Approximation algorithms for combinatorial optimization : 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedings
Na minha lista:
| Autor Corporativo: | |
|---|---|
| Outros Autores: | , , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado em: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Colecção: | Lecture notes in computer science
2462 |
| Assuntos: | |
| Acesso em linha: | 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, 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 |
| LEADER | 04814nam a22004577a 4500 | ||
|---|---|---|---|
| 001 | 969679 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155177710 | ||
| 020 | |a 9783540457534 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International workshop on approximation algorithms for combinatorial optimization problems |n (05 |d :2002 |c :Rome). | |
| 245 | 1 | 0 | |a Approximation algorithms for combinatorial optimization : |b 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 : proceedings |c [edited by] Klaus Jansen, Stefano Leonardi, Vijay Vazirani. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2462 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Recherche opérationnelle | ||
| 650 | |a Informatique | ||
| 650 | |a Optimisation combinatoire | ||
| 650 | |a Algorithmes | ||
| 650 | |a Complexité de calcul (informatique) | ||
| 650 | |a Analyse numérique | ||
| 650 | |a Approximation, Théorie de l' | ||
| 650 | |a Méthodes statistiques | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Vazirani, Vijay V., |d 1957- |4 pbd | |
| 700 | 1 | |a Leonardi, Stefano. |4 pbd | |
| 700 | 1 | |a Jansen, Klaus, |d 1961- |4 pbd | |
| 776 | 0 | |0 069103062 |t Approximation algorithms for combinatorial optimization |o 5th international workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 |o proceedings |f Klaus Jansen, Stefano Leonardi, Vijay Vazirani (eds.) |c Berlin |n Springer |d 2002 |p 1 vol. (VIII-269 p.) |s Lecture notes in computer science |z 3-540-44186-7 | |
| 776 | 0 | |t Approximation Algorithms for Combinatorial Optimization |b Texte imprimé |z 9783662164297 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-45753-4 |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-DV60TJ9N-N |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750671394 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-45753-4 |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754020215 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-45753-4 |z Accès INSA CVL | |
| 997 | |0 969679 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||