Approximation Complexity of Min-Max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack
Lecture Notes in Computer Science - Germany
doi 10.1007/11561071_76
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 2005
Authors
Publisher
Springer Berlin Heidelberg