Approximation algorithms for combinatorial optimization : international workshop, APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings
This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998. The volume presents 14 revised full papers together with three invited p...
Saved in:
| Corporate Author: | |
|---|---|
| Other Authors: | , |
| Format: | Livre numérique |
| Language: | Anglais |
| Published: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science
1444 |
| Subjects: | |
| Online Access: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Approximation algorithms for combinatorial optimization, international workshop, APPROX '98, Aalborg, Denmark, July 18-19, 1998, proceedings, Klaus Jansen, José Rolim, eds, 1998, New York, Springer, 1 vol. (VIII-199 p.), Lecture notes in computer science, 3-540-64736-8 • Approximation Algorithms for Combinatorial Optimization, Texte imprimé, 9783662191989 |
Table of Contents:
- Approximations of independent sets in graphs
- Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems
- The Steiner tree problem and its generalizations
- Approximation schemes for covering and scheduling in related machines
- One for the price of two: A unified approach for approximating covering problems
- Approximation of geometric dispersion problems
- Approximating k-outconnected subgraph problems
- Lower bounds for on-line scheduling with precedence constraints on identical machines
- Instant recognition of half integrality and 2-approximations
- The t-vertex cover problem: Extending the half integrality framework with budget constraints
- A new fully polynomial approximation scheme for the knapsack problem
- On the hardness of approximating spanners
- Approximating circular arc colouring and bandwidth allocation in all-optical ring networks
- Approximating maximum independent set in k-clique-free graphs
- Approximating an interval scheduling problem
- Finding dense subgraphs with semidefinite programming
- Best possible approximation algorithm for MAX SAT with cardinality constraint.