9783540654315 - complexity and approximation: combinatorial optimization problems and their approximability properties von ausiello, giorgio; crescenzi, pierluigi; gambosi, giorgio; kann, viggo; marchetti-spaccamela, alberto; protasi, marco (7 Ergebnisse)
- Hardcover
Anbieter: ThriftBooks-Phoenix, Phoenix, USAThriftBooks-Phoenix
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 17,36
Versand nach gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
- Hardcover
Anbieter: ThriftBooks-Atlanta, AUSTELL, USAThriftBooks-Atlanta
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Befriedigend
EUR 17,36
Versand nach gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
- Hardcover
Anbieter: ThriftBooks-Dallas, Dallas, USAThriftBooks-Dallas
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 17,36
Versand nach gratisVersand innerhalb von USAAnzahl: 1 verfügbar
Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.
- Hardcover
Anbieter: Phatpocket Limited, Waltham Abbey, Vereinigtes KönigreichPhatpocket Limited
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Befriedigend
EUR 35,90
EUR 12,31 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Zustand: 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.
Complexity and approximation. Combinatorial optimization problems and their approximability properties ; with 4 tables.
Ausiello, Giorgio; Crescenzi, Pierluigi; Gambosi, Giorgio; Kann, Viggo; Marchetti-Spaccamela, Alberto; Protasi, Marco
- Hardcover
Anbieter: Antiquariat Bookfarm, Löbnitz, DeutschlandAntiquariat Bookfarm
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht
EUR 19,90
EUR 40,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
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.
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Ausiello, Giorgio; Crescenzi, Pierluigi; Gambosi, Giorgio; Kann, Viggo; Marchetti-Spaccamela, Alberto; Protasi, Marco
- Hardcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 99,02
EUR 13,86 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
Sprache: Englisch
Verlag: Springer Berlin Heidelberg, Springer Berlin Heidelberg 1999
- Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 90,90
EUR 66,28 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Buch. Zustand: 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.
