Articles liés à Approximation Algorithms for Combinatorial Optimization:...
Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings - Couverture souple
Synopsis
The Workshop on Approximation Algorithms for Combinatorial Optimization ProblemsAPPROX'2000 focuses on algorithmic and complexity aspects ar- ing in the development of e?cient approximate solutions to computationally di?cult problems. It aims, in particular, at fostering cooperation among - gorithmic and complexity researchers in the ?eld. The workshop, to be held at the Max-Planck-Institute for Computer Science in Saarbruc ] ken, Wermany, co-locates with ESA'2020 and WWE'2000. We would like to thank the local organizers at the Max-Planck-Institute (AG 8, Kurt Mehlhorn), for this opp- tunity. APPVOXis an annual meeting, with previousworkshopsin Aalborg and Berkeley. Previous proceedings appeared as LNCS 1464 and 1671. Topics of interest for APPROX'2000 are: design and analysis of appro- mation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routingand?owproblems, coloringandiartitioning, cutsandconnectivity, pa- ing and covering, geometric problems, network design, and various applications. The numberof submitted papersto APPROX'2000was68 fromwhich 23 paters were selected. This volume contains the selected papers plus papers by invited speakers. All papers published in the workshop proceedings nere selected by the program committee on the basis of referee reports. Each paper was reviewed vy at least three referees who judged the papers for originality, quality, and consistency with the topics of the conference.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Acheter neuf
Afficher cet article
EUR 29,16
EUR 7,74 expédition depuis Etats-Unis vers France
Destinations, frais et délais
Résultats de recherche pour Approximation Algorithms for Combinatorial Optimization:...
Image d'archives
Approximation Algorithms for Combinatorial Optimization
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : New. pp. 292. N° de réf. du vendeur 263077412
Quantité disponible : 1 disponible(s)
Image d'archives
Approximation Algorithms for Combinatorial Optimization
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. pp. 292. N° de réf. du vendeur 183077422
Quantité disponible : 1 disponible(s)
Image d'archives
Approximation Algorithms for Combinatorial Optimization
impression à la demandeVendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. pp. 292 Illus. This item is printed on demand. N° de réf. du vendeur 5851899
Quantité disponible : 1 disponible(s)
Image d'archives
Approximation Algorithms for Combinatorial Optimization : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings
Edité par
Springer Berlin Heidelberg, 2000
ISBN 10 : 3540679960
ISBN 13 : 9783540679967
Ancien ou d'occasion
Couverture souple
Vendeur : Buchpark, Trebbin, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Sehr gut. Zustand: Sehr gut | Seiten: 292 | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 18702/202
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Approximation Algorithms for Combinatorial Optimization
Edité par
Springer Berlin Heidelberg, 2000
ISBN 10 : 3540679960
ISBN 13 : 9783540679967
Neuf
Kartoniert / Broschiert
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Kartoniert / Broschiert. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 . N° de réf. du vendeur 4898514
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Approximation Algorithms for Combinatorial Optimization : Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings
Edité par
Springer Berlin Heidelberg, 2000
ISBN 10 : 3540679960
ISBN 13 : 9783540679967
Neuf
Taschenbuch
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - The Workshop on Approximation Algorithms for Combinatorial Optimization ProblemsAPPROX 2000 focuses on algorithmic and complexity aspects ar- ing in the development of e cient approximate solutions to computationally di cult problems. It aims, in particular, at fostering cooperation among - gorithmic and complexity researchers in the eld. The workshop, to be held at the Max-Planck-Institute for Computer Science in Saarbruc ken, Wermany, co-locates with ESA 2020 and WWE 2000. We would like to thank the local organizers at the Max-Planck-Institute (AG 8, Kurt Mehlhorn), for this opp- tunity. APPVOXis an annual meeting, with previousworkshopsin Aalborg and Berkeley. Previous proceedings appeared as LNCS 1464 and 1671. Topics of interest for APPROX 2000 are: design and analysis of appro- mation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routingand owproblems,coloringandiartitioning,cutsandconnectivity,pa- ing and covering, geometric problems, network design, and various applications. The numberof submitted papersto APPROX 2000was68 fromwhich 23 paters were selected. This volume contains the selected papers plus papers by invited speakers. All papers published in the workshop proceedings nere selected by the program committee on the basis of referee reports. Each paper was reviewed vy at least three referees who judged the papers for originality, quality, and consistency with the topics of the conference. N° de réf. du vendeur 9783540679967
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Approximation Algorithms for Combinatorial Optimization
Edité par
Springer Berlin Heidelberg Aug 2000, 2000
ISBN 10 : 3540679960
ISBN 13 : 9783540679967
Neuf
Taschenbuch
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The Workshop on Approximation Algorithms for Combinatorial Optimization ProblemsAPPROX 2000 focuses on algorithmic and complexity aspects ar- ing in the development of e cient approximate solutions to computationally di cult problems. It aims, in particular, at fostering cooperation among - gorithmic and complexity researchers in the eld. The workshop, to be held at the Max-Planck-Institute for Computer Science in Saarbruc ken, Wermany, co-locates with ESA 2020 and WWE 2000. We would like to thank the local organizers at the Max-Planck-Institute (AG 8, Kurt Mehlhorn), for this opp- tunity. APPVOXis an annual meeting, with previousworkshopsin Aalborg and Berkeley. Previous proceedings appeared as LNCS 1464 and 1671. Topics of interest for APPROX 2000 are: design and analysis of appro- mation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routingand owproblems,coloringandiartitioning,cutsandconnectivity,pa- ing and covering, geometric problems, network design, and various applications. The numberof submitted papersto APPROX 2000was68 fromwhich 23 paters were selected. This volume contains the selected papers plus papers by invited speakers. All papers published in the workshop proceedings nere selected by the program committee on the basis of referee reports. Each paper was reviewed vy at least three referees who judged the papers for originality, quality, and consistency with the topics of the conference. 292 pp. Englisch. N° de réf. du vendeur 9783540679967
Quantité disponible : 2 disponible(s)
Image d'archives
Approximation Algorithms for C
Edité par
Springer, 2000
ISBN 10 : 3540679960
ISBN 13 : 9783540679967
Ancien ou d'occasion
Couverture souple
Vendeur : SecondSale, Montgomery, IL, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. N° de réf. du vendeur 00076206683
Quantité disponible : 2 disponible(s)
Image d'archives
Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (Lecture Notes in Computer Science, 1913)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540679967_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (Lecture Notes in Computer Science, 1913)
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9783540679967
Quantité disponible : Plus de 20 disponibles