Verwandte Artikel zu Approximation Algorithms for Combinatorial Optimization:...
Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings: 2462 (Lecture Notes in Computer Science) - Softcover
Inhaltsangabe
The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e?cient approximate solutions to computationally d- ?cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the ?eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc ¨ ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ?ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications. The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e?cient approximate solutions to computationally d- ?cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the ?eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc ¨ ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ?ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications. The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R.
Reseña del editor
This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002.
The 20 revised full papers presented were carefully reviewed and selected from 54 submissions. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and other fields.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 48,37
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für Approximation Algorithms for Combinatorial Optimization:...
Foto des Verkäufers
Approximation Algorithms for Combinatorial Optimization
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 fo. Bestandsnummer des Verkäufers 4890914
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e cient approximate solutions to computationally d- cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications. The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R. Bestandsnummer des Verkäufers 9783540441861
Anzahl: 1 verfügbar
Foto des Verkäufers
Approximation Algorithms for Combinatorial Optimization
ISBN 10: 3540441867
ISBN 13: 9783540441861
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e cient approximate solutions to computationally d- cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc ¿ ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications. The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R. 284 pp. Englisch. Bestandsnummer des Verkäufers 9783540441861
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings (Lecture Notes in Computer Science, 2462)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540441861_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, Approx 2002, Rome, Italy, September 17-21, 2002 : Proceedings
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 1179420-n
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings (Lecture Notes in Computer Science)
Anbieter: Chiron Media, Wallingford, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
Paperback. Zustand: New. Bestandsnummer des Verkäufers 6666-IUK-9783540441861
Anzahl: 10 verfügbar
Foto des Verkäufers
Approximation Algorithms for Combinatorial Optimization
Verlag:
Springer Berlin Heidelberg Sep 2002, 2002
ISBN 10: 3540441867
ISBN 13: 9783540441861
Neu
Taschenbuch
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The Workshop on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2002 focused on algorithmic and complexity aspects ar- ing in the development of e cient approximate solutions to computationally d- cult problems. It aimed, in particular, to foster cooperation among algorithmic and complexity researchers in the eld. The workshop, held at the University of Rome La Sapienza, Rome, Italy, was part of the ALGO 2002 event, in conju- tion with ESA 2002 and WABI 2002. We would like to thank the local organizers at the University of Rome La Sapienza for this opportunity. APPROX is an - nual meeting, with previous workshops in Aalborg, Berkeley, Saarbruc ken, and Berkeley. Previous proceedings appeared as LNCS 1444, 1671, 1913, and 2129. Topics of interest for APPROX 2002 were: design and analysis of approxi- tion algorithms, inapproximability results, on-line problems, randomization te- niques, average-case analysis, approximation classes, scheduling problems, ro- ing and ow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, applications to game theory, and other applications. The number of submitted papers to APPROX 2002 was 54 from which 20 papers were selected. This volume contains the selected papers together with abstracts of invited lectures by Yuval Rabani (Technion) and R. 284 pp. Englisch. Bestandsnummer des Verkäufers 9783540441861
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 Proceedings
Verlag:
Springer Verlag, New York City, 2002
ISBN 10: 3540441867
ISBN 13: 9783540441861
Gebraucht
Hardcover
Anbieter: Doss-Haus Books, Redondo Beach, CA, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Very Good. No Jacket. Hardcover 2002 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Laminated covers and text in very good to near fine condition. Series: Lecture Notes in Computer Science ;2462. [viii, 269 p. : ill. ; 24 cm]. Bestandsnummer des Verkäufers 010678
Anzahl: 1 verfügbar
Foto des Verkäufers
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, Approx 2002, Rome, Italy, September 17-21, 2002 : Proceedings
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers 1179420-n
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, Approx 2002, Rome, Italy, September 17-21, 2002 : Proceedings
Anbieter: GreatBookPrices, Columbia, MD, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: As New. Unread book in perfect condition. Bestandsnummer des Verkäufers 1179420
Anzahl: Mehr als 20 verfügbar