Verwandte Artikel zu Complexity and Approximation: Combinatorial Optimization...
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties - Hardcover
Inhaltsangabe
Book by Ausiello G Crescenzi P Kann V Marchettisp Gambosi
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagSpringer
- Erscheinungsdatum2002
- ISBN 10 3540654313
- ISBN 13 9783540654315
- EinbandTapa dura
- SpracheEnglisch
- Anzahl der Seiten548
- HerausgeberAusiello Giorgio, Crescenzi Pierluigi, Gambosi Giorgio
Neu kaufen
Diesen Artikel anzeigen
EUR 86,10
EUR 6,18 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Complexity and Approximation: Combinatorial Optimization...
Beispielbild für diese ISBN
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Verlag:
Springer (edition Corrected), 1999
ISBN 10: 3540654313
ISBN 13: 9783540654315
Gebraucht
Hardcover
Anbieter: BooksRun, Philadelphia, PA, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Good. Corrected. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Bestandsnummer des Verkäufers 3540654313-11-1
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Anbieter: HPB-Red, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: 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! Bestandsnummer des Verkäufers S_425252742
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Anbieter: Phatpocket Limited, Waltham Abbey, HERTS, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
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. Bestandsnummer des Verkäufers Z1-V-012-02581
Anzahl: 1 verfügbar
Foto des Verkäufers
Complexity and approximation. Combinatorial optimization problems and their approximability properties ; with 4 tables.
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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. Bestandsnummer des Verkäufers 2340249
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Anbieter: BennettBooksLtd, North Las Vegas, NV, USA
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: New. In shrink wrap. Looks like an interesting title! Bestandsnummer des Verkäufers Q-3540654313
Anzahl: 1 verfügbar
Foto des Verkäufers
Complexity and Approximation
Verlag:
Springer Berlin Heidelberg Nov 1999, 1999
ISBN 10: 3540654313
ISBN 13: 9783540654315
Neu
Hardcover
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9783540654315
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540654315_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Anbieter: Lucky's Textbooks, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020173764
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Complexity and Approximation : Combinatorial Optimization Problems and Their Approximability Properties
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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. Bestandsnummer des Verkäufers 9783540654315
Anzahl: 1 verfügbar
Foto des Verkäufers
Complexity and Approximation
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 4897213
Anzahl: Mehr als 20 verfügbar