Approximation Algorithms for Combinatorial Optimization: Third International Workshop, Approx 2000 Saarbrucken, Germany, September 5-8, 2000 Proceedings
Approximation Algorithms for Combinatorial Optimization: Third International Workshop, Approx 2000 Saarbrucken, Germany, September 5-8, 2000 Proceedings
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 ...
Read More
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.
Read Less
Add this copy of Approximation Algorithms for Combinatorial Optimization to cart. $25.75, good condition, Sold by Big River Books rated 5.0 out of 5 stars, ships from Powder Springs, GA, UNITED STATES, published 2000 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
This book is in good condition. The cover has minor creases or bends. The binding is tight and pages are intact. Some pages may have writing or highlighting.
Add this copy of Approximation Algorithms for Combinatorial Optimization to cart. $40.10, like new condition, Sold by Media Smart rated 4.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 2000 by Springer.
Add this copy of Approximation Algorithms for Combinatorial Optimization to cart. $40.74, very good condition, Sold by Doss-Haus Books rated 5.0 out of 5 stars, ships from Redondo Beach, CA, UNITED STATES, published 2000 by Springer Verlag.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very Good. Book. 8vo-over 7¾"-9¾" tall. Hardcover 2000 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Covers and text in very good condition. Series: Lecture Notes in Computer Science; 1913. [273 pages]
Add this copy of Approximation Algorithms for Combinatorial Optimization to cart. $47.42, like new condition, Sold by GreatBookPricesUK5 rated 4.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2000 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Trade paperback (US). Glued binding. 282 p. Lecture Notes in Computer Science, 1913. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Approximation Algorithms for Combinatorial Optimization to cart. $53.69, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2000 by Springer.
Add this copy of Approximation Algorithms for Combinatorial Optimization to cart. $55.34, like new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2000 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Trade paperback (US). Glued binding. 282 p. Lecture Notes in Computer Science, 1913. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Approximation Algorithms for Combinatorial Optimization to cart. $58.64, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2000 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Trade paperback (US). Glued binding. 282 p. Lecture Notes in Computer Science, 1913. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
