Approximation algorithms for combinatorial optimization : third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
1913 |
| Sujets: | |
| Accès en ligne: | 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, 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 |
| LEADER | 04292nam a22004337a 4500 | ||
|---|---|---|---|
| 001 | 949191 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155219820 | ||
| 020 | |a 9783540444367 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International workshop on approximation algorithms for combinatorial optimization problems |n (03 |d :2000 |c :Sarrebruck, Allemagne). | |
| 245 | 1 | 0 | |a Approximation algorithms for combinatorial optimization : |b third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 : proceedings |c [edited by] Klaus Jansen, Samir Khuller. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 1913 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 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 Informatique | ||
| 650 | |a Optimisation combinatoire | ||
| 650 | |a Algorithmes | ||
| 650 | |a Approximation, Théorie de l' | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Calcul des variations | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Jansen, Klaus, |d 1961- |4 pbd | |
| 700 | 1 | |a Khuller, Samir, |d 1965- |4 pbd | |
| 776 | 0 | |0 052245306 |t Approximation algorithms for combinatorial optimization |o third international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000 |o proceedings |f Klaus Jansen, Samir Khuller (eds.) |d 2000 |c New York |n Springer |p 1 vol. (IX-273 p.) |s Lecture notes in computer science |z 3-540-67996-0 | |
| 776 | 0 | |t Approximation Algorithms for Combinatorial Optimization |b Texte imprimé |z 9783662188859 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-44436-X |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-ZXJQSP4L-7 |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:74805314X |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-44436-X |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:751504394 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-44436-X |z Accès INSA CVL | |
| 997 | |0 949191 |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/ | ||