Items related to Complexity and Approximation: Combinatorial Optimization...
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties - Hardcover
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.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for Complexity and Approximation: Combinatorial Optimization...
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
Quantity: 2 available
Stock Image
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Published by
Springer (edition Corrected), 1999
ISBN 10: 3540654313
ISBN 13: 9783540654315
Used
Hardcover
Seller: BooksRun, Philadelphia, PA, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. Corrected. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Seller Inventory # 3540654313-11-1
Quantity: 1 available
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
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
Quantity: 1 available
Stock Image
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Seller: SecondSale, Montgomery, IL, U.S.A.
Seller rating 4 out of 5 stars
Condition: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Seller Inventory # 00091374483
Quantity: 1 available
Stock Image
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540654315_new
Quantity: Over 20 available
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 5 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
Quantity: Over 20 available
Seller Image
Complexity and Approximation
Published by
Springer Berlin Heidelberg Nov 1999, 1999
ISBN 10: 3540654313
ISBN 13: 9783540654315
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - 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. 548 pp. Englisch. Seller Inventory # 9783540654315
Quantity: 2 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
Quantity: 1 available
Stock Image
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Seller Inventory # S_367981655
Quantity: 1 available