Articles liés à Complexity and Approximability Properties: Combinatorial...
Complexity and Approximability Properties: Combinatorial Optimization Problems and Their Approximability Properties - Couverture rigide
Synopsis
Book by Ausiello G Crescenzi P Kann V Marchettisp Gambosi
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurSpringer-Verlag Berlin and Heidelberg GmbH & Co. K
- Date d'édition1999
- ISBN 10 3540654313
- ISBN 13 9783540654315
- ReliureRelié
- Langueanglais
- Numéro d'édition1
- Nombre de pages524
Acheter neuf
Afficher cet article
EUR 86,10
EUR 6,18 expédition vers Etats-Unis
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Complexity and Approximability Properties: Combinatorial...
Image d'archives
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Edité par
Springer (edition Corrected), 1999
ISBN 10 : 3540654313
ISBN 13 : 9783540654315
Ancien ou d'occasion
Couverture rigide
Vendeur : BooksRun, Philadelphia, PA, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Good. Corrected. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. N° de réf. du vendeur 3540654313-11-1
Quantité disponible : 1 disponible(s)
Image d'archives
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Edité par
Springer, 1999
ISBN 10 : 3540654313
ISBN 13 : 9783540654315
Ancien ou d'occasion
Couverture rigide
Vendeur : HPB-Red, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
hardcover. Etat : 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! N° de réf. du vendeur S_425252742
Quantité disponible : 1 disponible(s)
Image d'archives
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Edité par
Springer, 1999
ISBN 10 : 3540654313
ISBN 13 : 9783540654315
Ancien ou d'occasion
Couverture rigide
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur Z1-V-012-02581
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Complexity and approximation. Combinatorial optimization problems and their approximability properties ; with 4 tables.
Edité par
Berlin, Springer, 2003
ISBN 10 : 3540654313
ISBN 13 : 9783540654315
Ancien ou d'occasion
Couverture rigide
Vendeur : Antiquariat Bookfarm, Löbnitz, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
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. N° de réf. du vendeur 2340249
Quantité disponible : 1 disponible(s)
Image d'archives
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Vendeur : BennettBooksLtd, North Las Vegas, NV, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
hardcover. Etat : New. In shrink wrap. Looks like an interesting title! N° de réf. du vendeur Q-3540654313
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Complexity and Approximation
Edité par
Springer Berlin Heidelberg Nov 1999, 1999
ISBN 10 : 3540654313
ISBN 13 : 9783540654315
Neuf
Couverture rigide
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783540654315
Quantité disponible : 2 disponible(s)
Image d'archives
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9783540654315_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020173764
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Complexity and Approximation : Combinatorial Optimization Problems and Their Approximability Properties
Edité par
Springer Berlin Heidelberg, 1999
ISBN 10 : 3540654313
ISBN 13 : 9783540654315
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9783540654315
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Complexity and Approximation
Edité par
Springer Berlin Heidelberg, 1999
ISBN 10 : 3540654313
ISBN 13 : 9783540654315
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur 4897213
Quantité disponible : Plus de 20 disponibles