Approximation algorithms for combinatorial optimization : 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedings
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
2462 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
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, 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, proceedings, Klaus Jansen, Stefano Leonardi, Vijay Vazirani (eds.), Berlin, Springer, 2002, 1 vol. (VIII-269 p.), Lecture notes in computer science, 3-540-44186-7 • Approximation Algorithms for Combinatorial Optimization, Texte imprimé, 9783662164297 |
Obsah:
- Search and Classification of High Dimensional Data
- Bicriteria Spanning Tree Problems
- Improved Approximation Algorithms for Multilevel Facility Location Problems
- On Constrained Hypergraph Coloring and Scheduling
- On the Power of Priority Algorithms for Facility Location and Set Cover
- Two Approximation Algorithms for 3-Cycle Covers
- Approximation Algorithms for the Unsplittable Flow Problem
- 1.5-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
- Typical Rounding Problems
- Approximating Min-sum Set Cover
- Approximating Maximum Edge Coloring in Multigraphs
- Approximating the Complement of the Maximum Compatible Subset of Leaves of k Trees
- A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs
- Facility Location and the Geometric Minimum-Diameter Spanning Tree
- Improved Approximation Algorithms for the Partial Vertex Cover Problem
- Minimum Restricted Diameter Spanning Trees
- Hardness of Approximation for Vertex-Connectivity Network-Design Problems
- Non-abusiveness Helps: An % MathType!MTEF!2!1!+- % feaafiart1ev1aaatCvAUfKttLearuqr1ngBPrgarmWu51MyVXgatC % vAUfeBSjuyZL2yd9gzLbvyNv2CaeHbuLwBLnhiov2DGi1BTfMBaeHb % d9wDYLwzYbItLDharqqtubsr4rNCHbGeaGqiVu0Je9sqqrpepC0xbb % L8F4rqqrFfpeea0xe9Lq-Jc9vqaqpepm0xbba9pwe9Q8fs0-yqaqpe % pae9pg0FirpepeKkFr0xfr-xfr-xb9adbaqaaeGaciGaaiaadeWaaq % aadaqbaaGcbaGaaGOmamaaCaaaleqabaGagiiBaWMaei4Ba8Maei4z % aCgaaOWaaWbaaSqabeaadaahaaadbeqaamaaBaaabaWaaWbaaeqaba % GaaGymaiabgkHiTiabgIGiodaaaeqaaaaaaaGcdaahaaWcbeqaaiab % d6gaUbaaaaa!4546! \[ 2^{\log } ^{^{_{^{1 - \in } } } } ^n \] (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem
- Routing and Admission Control in Networks with Advance Reservations
- Improved Approximation Algorithms for Metric Facility Location Problems
- Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products
- Primal-Dual Algorithms for Connected Facility Location Problems.