Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Ausiello, Giorgio; Crescenzi, Pierluigi; Gambosi, Giorgio; Kann, Viggo; Marchetti-Spaccamela, Alberto; Protasi, Marco
ISBN 10: 3540654313 ISBN 13: 9783540654315
Published by Springer, 1999
New
Hardcover
From
Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
AbeBooks Seller since March 25, 2015
This specific item is no longer available.
About this Item
Description:
In. Seller Inventory # ria9783540654315_new
Synopsis:
N COMPUTER applications we are used to live with approximation. Var I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numer ical analysis or in computational geometry from the fact that we cannot perform computations with arbitrary precision and we have to truncate the representation of real numbers. In other cases, we use to approximate com plex mathematical objects by simpler ones: for example, we sometimes represent non-linear functions by means of piecewise linear ones. The need to solve difficult optimization problems is another reason that forces us to deal with approximation. In particular, when a problem is computationally hard (i. e. , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polynomial time. We call this type of solution an approximate solution and the corresponding algorithm a polynomial-time approximation algorithm. Most combinatorial optimization problems of great practical relevance are, indeed, computationally intractable in the above sense. In formal terms, they are classified as Np-hard optimization problems.
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: Complexity and Approximation: Combinatorial ...
Publisher: Springer
Publication Date: 1999
Binding: Hardcover
Condition: New
Top Search Results from the AbeBooks Marketplace
Seller Image
Complexity and approximation : combinatorial optimization problems and their approximability properties.
Seller: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germany
Seller rating 5 out of 5 stars
Hardcover-Großformat. Condition: Gut. XIX, 524 Seiten; In ENGLISCHER Sprache. Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber und kann entsprechende Merkmale aufweisen (Rückenschild, Instituts-Stempel.). Sprache: Englisch Gewicht in Gramm: 1175. Seller Inventory # 2242444
Buy Used
US$ 15.72
US$ 18.74 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Complexity and approximation. Combinatorial optimization problems and their approximability properties ; with 4 tables.
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Seller rating 5 out of 5 stars
2. corrected print. 524 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9783540654315 Sprache: Englisch Gewicht in Gramm: 990. Seller Inventory # 2340249
Buy Used
US$ 24.08
US$ 46.98 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Stock Image
Complexity and Approximation : Combinatorial Optimization Problems and Their Approximability Properties
Published by
Springer Berlin / Heidelberg, 1999
ISBN 10: 3540654313
ISBN 13: 9783540654315
Used
Hardcover
Seller: Better World Books Ltd, Dunfermline, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # GRP97606473
Buy Used
US$ 30.17
US$ 10.70 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Seller Inventory # Z1-V-012-02581
Buy Used
US$ 49.02
US$ 14.23 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Seller: GoldBooks, Denver, CO, U.S.A.
Seller rating 5 out of 5 stars
Condition: new. Seller Inventory # 83K87_91_3540654313
Seller Image
Complexity and Approximation
Published by
Springer Berlin Heidelberg, 1999
ISBN 10: 3540654313
ISBN 13: 9783540654315
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Comprehensive Assessment of numerous problems in combinatorial optimizationThis book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization probl. Seller Inventory # 4897213
Buy New
US$ 93.31
US$ 57.54 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Seller: BennettBooksLtd, San Diego, NV, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-3540654313
Seller Image
Complexity and Approximation | Combinatorial Optimization Problems and Their Approximability Properties
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Complexity and Approximation | Combinatorial Optimization Problems and Their Approximability Properties | Giorgio Ausiello (u. a.) | Buch | xx | Englisch | 1999 | Springer-Verlag GmbH | EAN 9783540654315 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 106674915
Buy New
US$ 96.96
US$ 82.22 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 5 available
Seller Image
Complexity and Approximation : Combinatorial Optimization Problems and Their Approximability Properties
Published by
Springer Berlin Heidelberg, 1999
ISBN 10: 3540654313
ISBN 13: 9783540654315
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - N COMPUTER applications we are used to live with approximation. Var I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numer ical analysis or in computational geometry from the fact that we cannot perform computations with arbitrary precision and we have to truncate the representation of real numbers. In other cases, we use to approximate com plex mathematical objects by simpler ones: for example, we sometimes represent non-linear functions by means of piecewise linear ones. The need to solve difficult optimization problems is another reason that forces us to deal with approximation. In particular, when a problem is computationally hard (i. e. , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polynomial time. We call this type of solution an approximate solution and the corresponding algorithm a polynomial-time approximation algorithm. Most combinatorial optimization problems of great practical relevance are, indeed, computationally intractable in the above sense. In formal terms, they are classified as Np-hard optimization problems. Seller Inventory # 9783540654315
Buy New
US$ 109.98
US$ 77.85 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Complexity and Approximation
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Nov 1999, 1999
ISBN 10: 3540654313
ISBN 13: 9783540654315
New
Hardcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware -N COMPUTER applications we are used to live with approximation. Var I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numer ical analysis or in computational geometry from the fact that we cannot perform computations with arbitrary precision and we have to truncate the representation of real numbers. In other cases, we use to approximate com plex mathematical objects by simpler ones: for example, we sometimes represent non-linear functions by means of piecewise linear ones. The need to solve difficult optimization problems is another reason that forces us to deal with approximation. In particular, when a problem is computationally hard (i. e. , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polynomial time. We call this type of solution an approximate solution and the corresponding algorithm a polynomial-time approximation algorithm. Most combinatorial optimization problems of great practical relevance are, indeed, computationally intractable in the above sense. In formal terms, they are classified as Np-hard optimization problems.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 548 pp. Englisch. Seller Inventory # 9783540654315
Buy New
US$ 109.98
US$ 70.48 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available