Published by Springer (edition Corrected), 1999
ISBN 10: 3540654313 ISBN 13: 9783540654315
Language: English
Seller: BooksRun, Philadelphia, PA, U.S.A.
Hardcover. Condition: Good. Corrected. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported.
Seller: HPB-Red, Dallas, TX, U.S.A.
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: Antiquariat Bookfarm, Löbnitz, Germany
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: BennettBooksLtd, North Las Vegas, NV, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title!
Published by Springer Berlin Heidelberg, 2013
ISBN 10: 3642635814 ISBN 13: 9783642635816
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 88.36
Convert currencyQuantity: 1 available
Add to basketTaschenbuch. 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: Ria Christie Collections, Uxbridge, United Kingdom
US$ 116.92
Convert currencyQuantity: Over 20 available
Add to basketCondition: New. In.
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
US$ 126.74
Convert currencyQuantity: Over 20 available
Add to basketCondition: New.
Published by Springer Berlin Heidelberg, 1999
ISBN 10: 3540654313 ISBN 13: 9783540654315
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
US$ 107.24
Convert currencyQuantity: 1 available
Add to basketBuch. 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: Revaluation Books, Exeter, United Kingdom
US$ 138.72
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: Brand New. 548 pages. 9.50x7.10x1.00 inches. In Stock.
Seller: Mispah books, Redhill, SURRE, United Kingdom
US$ 148.27
Convert currencyQuantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.