Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

17

(FIVE YEARS 0)

H-INDEX

8

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540647362, 9783540690672

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the hardness of approximating spanners

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053970 ◽

1998 ◽

pp. 135-146 ◽

Author(s):

Guy Kortsarz

Download Full-text

Approximating maximum independent set in k-clique-free graphs

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053972 ◽

1998 ◽

pp. 159-168

Author(s):

Ingo Schiermeyer

Keyword(s):

Independent Set ◽

Maximum Independent Set

Download Full-text

Approximation of geometric dispersion problems

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053964 ◽

1998 ◽

pp. 63-75 ◽

Author(s):

Christoph Baur ◽

Sándor P. Fekete

Download Full-text

Approximating an interval scheduling problem

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053973 ◽

1998 ◽

pp. 169-180 ◽

Author(s):

Frits C. R. Spieksma

Keyword(s):

Scheduling Problem ◽

Interval Scheduling

Download Full-text

Approximations of independent sets in graphs

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053959 ◽

1998 ◽

pp. 1-13 ◽

Author(s):

MagnÚs M. Halldórsson

Keyword(s):

Independent Sets

Download Full-text

Instant recognition of half integrality and 2-approximations

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053967 ◽

1998 ◽

pp. 99-110 ◽

Author(s):

Dorit S. Hochbaum

Download Full-text

Approximation schemes for covering and scheduling in related machines

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053962 ◽

1998 ◽

pp. 39-47 ◽

Author(s):

Yossi Azar ◽

Leah Epstein

Keyword(s):

Approximation Schemes ◽

Related Machines

Download Full-text

The Steiner tree problem and its generalizations

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053961 ◽

1998 ◽

pp. 33-38 ◽

Author(s):

Vijay V. Vazirani

Keyword(s):

Steiner Tree ◽

Steiner Tree Problem

Download Full-text

Approximating circular arc colouring and bandwidth allocation in all-optical ring networks

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053971 ◽

1998 ◽

pp. 147-158 ◽

Author(s):

Vijay Kumar

Keyword(s):

Bandwidth Allocation ◽

Ring Networks ◽

Circular Arc ◽

All Optical ◽

Download Full-text

A new fully polynomial approximation scheme for the knapsack problem

Approximation Algorithms for Combinatiorial Optimization - Lecture Notes in Computer Science ◽

10.1007/bfb0053969 ◽

1998 ◽

pp. 123-134 ◽

Author(s):

Hans Kellerer ◽

Ulrich Pferschy

Keyword(s):

Polynomial Approximation ◽

Knapsack Problem ◽

Approximation Scheme ◽

Fully Polynomial Approximation Scheme

Download Full-text