Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
1913 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
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, third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, proceedings, Klaus Jansen, Samir Khuller (eds.), 2000, New York, Springer, 1 vol. (IX-273 p.), Lecture notes in computer science, 3-540-67996-0 • Approximation Algorithms for Combinatorial Optimization, Texte imprimé, 9783662188859 |
Taula de continguts:
- Invited Talks
- Approximation Algorithms That Take Advice
- Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations
- Scheduling under Uncertainty: Optimizing against a Randomizing Adversary
- Approximation Algorithms for Facility Location Problems
- Contributed Talks
- An Approximation Algorithm for MAX DICUT with Given Sizes of Parts
- Maximizing Job Benefits On-Line
- Variable Length Sequencing with Two Lengths
- Randomized Path Coloring on Binary Trees
- Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem
- Greedy Approximation Algorithms for Finding Dense Components in a Graph
- Online Real-Time Preemptive Scheduling of Jobs with Deadlines
- On the Relative Complexity of Approximate Counting Problems
- On the Hardness of Approximating NP Witnesses
- Maximum Dispersion and Geometric Maximum Weight Cliques
- New Results for Online Page Replication
- Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses
- Approximation Algorithms for a Capacitated Network Design Problem
- An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem
- Improved Approximations for Tour and Tree Covers
- Approximating Node Connectivity Problems via Set Covers
- Rectangle Tiling
- Primal-Dual Approaches to the Steiner Problem
- On the Inapproximability of Broadcasting Time
- Polynomial Time Approximation Schemes for Class-Constrained Packing Problems
- Partial Servicing of On-Line Jobs
- Factor 4/3 Approximations for Minimum 2-Connected Subgraphs.