1
Published 2011
Springer Berlin Heidelberg
Subjects: ...Algorithms...

2
Published 2003
Springer Berlin Heidelberg
Table of Contents: ...Improving Linear Programming Approaches for the Steiner Tree Problem -- Algorithms and Experiments...

3
Published 2017
Springer International Publishing
Table of Contents: ...Approximation Algorithms for the k-Set Packing Problem -- On Linear and Semidefinite Programs...

4
Published 2010
Springer Berlin Heidelberg
Table of Contents: ... Fluctuations: To Buy or to Rent -- Approximation Algorithms for Multiple Strip Packing -- Approximating...

5
by Jansen, Klaus
Published 2003
Springer Berlin Heidelberg
Subjects: ...Algorithm Analysis and Problem Complexity...

6
by Jansen, Klaus
Published 2004
Springer Berlin Heidelberg
Subjects: ...Algorithm Analysis and Problem Complexity...

7
Published 2004
Springer Berlin Heidelberg
Table of Contents: ... in Optical Communication Networks -- Randomized Priority Algorithms -- Tradeoffs in Worst-Case Equilibria...

8
Published 2000
Springer Berlin Heidelberg
Table of Contents: ...Invited Talks -- Approximation Algorithms That Take Advice -- Instant Recognition of Polynomial...

9
Published 2002
Springer Berlin Heidelberg
Table of Contents: ...Primal-Dual Algorithms for Connected Facility Location Problems...

10
Published 1998
Springer Berlin Heidelberg
Table of Contents: ... of approximation algorithms: Two illustrative problems -- The Steiner tree problem and its generalizations...

11
Published 2006
Springer Berlin Heidelberg
Table of Contents: ...Contributed Talks -- On Approximation Algorithms for Data Mining Applications -- A Survey...

12
by Jansen, Klaus
Published 1998
Springer Berlin Heidelberg
Subjects: ...Algorithm Analysis and Problem Complexity...

13
by Jansen, Klaus
Published 2000
Springer-Verlag Berlin Heidelberg
Subjects: ...Algorithm Analysis and Problem Complexity...

14
by Jansen, Klaus
Published 2002
Springer-Verlag Berlin Heidelberg
Subjects: ...Algorithm Analysis and Problem Complexity...

15
Published 2007
Springer Berlin Heidelberg
Table of Contents: ... Sparse Random Graphs -- Sublinear Algorithms for Approximating String Compressibility...

16
Published 2010
Springer Berlin Heidelberg
Table of Contents: ...Contributed Talks of APPROX -- Approximation Algorithms for the Bottleneck Asymmetric Traveling...

17
Published 2011
Springer Berlin Heidelberg
Subjects: ...Algorithms...

18
Published 2012
Springer Berlin Heidelberg
Subjects: ...Algorithms...

19
Published 2001
Springer Berlin Heidelberg
Table of Contents: ... and Deadline Scheduling -- An Online Algorithm for the Postman Problem with a Small Penalty -- A Simple Dual...

20
Published 2004
Springer Berlin Heidelberg
Table of Contents: ... Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein...