Items related to 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, 2462) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Product Description
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.
"About this title" may belong to another edition of this title.
Search results for Approximation Algorithms for Combinatorial Optimization:...
Seller Image
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, Approx 2002, Rome, Italy, September 17-21, 2002 : Proceedings
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 1179420-n
Quantity: Over 20 available
Stock Image
Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings (Lecture Notes in Computer Science)
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9783540441861
Quantity: 10 available
Stock Image
Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings (Lecture Notes in Computer Science, 2462)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540441861_new
Quantity: Over 20 available
Seller Image
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, Approx 2002, Rome, Italy, September 17-21, 2002 : Proceedings
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 1179420
Quantity: Over 20 available
Seller Image
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings
Published by
Springer Berlin Heidelberg, 2002
ISBN 10: 3540441867
ISBN 13: 9783540441861
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540441861
Quantity: 1 available
Seller Image
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, Approx 2002, Rome, Italy, September 17-21, 2002 : Proceedings
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 1179420-n
Quantity: Over 20 available
Seller Image
Approximation Algorithms for Combinatorial Optimization
Published by
Springer Berlin Heidelberg, 2002
ISBN 10: 3540441867
ISBN 13: 9783540441861
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4890914
Quantity: Over 20 available
Stock Image
Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002 Proceedings
Published by
Springer Verlag, New York City, 2002
ISBN 10: 3540441867
ISBN 13: 9783540441861
Used
Hardcover
Seller: Doss-Haus Books, Redondo Beach, CA, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: 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]. Seller Inventory # 010678
Quantity: 1 available
Seller Image
Approximation Algorithms for Combinatorial Optimization : 5th International Workshop, Approx 2002, Rome, Italy, September 17-21, 2002 : Proceedings
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 1179420
Quantity: Over 20 available
Seller Image
Approximation Algorithms for Combinatorial Optimization
Published by
Springer Berlin Heidelberg Sep 2002, 2002
ISBN 10: 3540441867
ISBN 13: 9783540441861
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540441861
Quantity: 2 available