Items related to Approximation Algorithms and Semidefinite Programming

Approximation Algorithms and Semidefinite Programming - Softcover

 
Image Not Available

Synopsis

This introduction to aspects of semidefinite programming and its use in approximation algorithms develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others.

"synopsis" may belong to another edition of this title.

From the Back Cover

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material.  

There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms.

 

This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.

"About this title" may belong to another edition of this title.

  • PublisherSpringer
  • Publication date2014
  • ISBN 10 3642433324
  • ISBN 13 9783642433320
  • BindingPaperback
  • LanguageEnglish
  • Number of pages262

Buy Used

Condition: As New
Unread book in perfect condition... View this item

Shipping: US$ 19.63
From United Kingdom to U.S.A.

Destination, rates & speeds

Add to basket

Other Popular Editions of the Same Title

Image Not Available

Featured Edition

ISBN 10:  3642220142 ISBN 13:  9783642220142
Publisher: Springer, 2012
Hardcover

Search results for Approximation Algorithms and Semidefinite Programming

Seller Image

Gärtner, Bernd; Matousek, Jiri
Published by Springer, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
New Softcover

Seller: GreatBookPrices, Columbia, MD, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # 21002566-n

Contact seller

Buy New

US$ 71.22
Convert currency
Shipping: US$ 2.64
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Gärtner, Bernd; Matousek, Jiri
Published by Springer, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
New Softcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Mar3113020227443

Contact seller

Buy New

US$ 69.88
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Gärtner, Bernd; Matousek, Jiri
Published by Springer, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
New Softcover

Seller: California Books, Miami, FL, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # I-9783642433320

Contact seller

Buy New

US$ 79.00
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Gartner, Bernd
Published by Springer 2014-02, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
New PF

Seller: Chiron Media, Wallingford, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

PF. Condition: New. Seller Inventory # 6666-IUK-9783642433320

Contact seller

Buy New

US$ 69.01
Convert currency
Shipping: US$ 20.27
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 10 available

Add to basket

Stock Image

Gärtner, Bernd; Matousek, Jiri
Published by Springer, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
New Softcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In. Seller Inventory # ria9783642433320_new

Contact seller

Buy New

US$ 75.42
Convert currency
Shipping: US$ 15.68
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Gärtner, Bernd; Matousek, Jiri
Published by Springer, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
New Softcover

Seller: GreatBookPricesUK, Woodford Green, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # 21002566-n

Contact seller

Buy New

US$ 72.35
Convert currency
Shipping: US$ 19.63
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Jiri Matousek
ISBN 10: 3642433324 ISBN 13: 9783642433320
New Taschenbuch
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material. There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the 'semidefinite side' of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms. 264 pp. Englisch. Seller Inventory # 9783642433320

Contact seller

Buy New

US$ 71.25
Convert currency
Shipping: US$ 26.09
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket

Seller Image

Jiri Matousek
Published by Springer Berlin Heidelberg, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
New Taschenbuch

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material. There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the 'semidefinite side' of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms. Seller Inventory # 9783642433320

Contact seller

Buy New

US$ 71.25
Convert currency
Shipping: US$ 34.05
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Bernd Gärtner|Jiri Matousek
Published by Springer Berlin Heidelberg, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
New Softcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. First textbook treatment of an often-taught topicCombines in-depth treatment of classical material with coverage of very recent developmentsEvery chapter comes with an extensive list of exercisesSemidefinite programs constitute o. Seller Inventory # 5060715

Contact seller

Buy New

US$ 62.18
Convert currency
Shipping: US$ 55.57
From Germany to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Gärtner, Bernd; Matousek, Jiri
Published by Springer, 2014
ISBN 10: 3642433324 ISBN 13: 9783642433320
Used Softcover

Seller: GreatBookPricesUK, Woodford Green, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: As New. Unread book in perfect condition. Seller Inventory # 21002566

Contact seller

Buy Used

US$ 132.07
Convert currency
Shipping: US$ 19.63
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

There are 2 more copies of this book

View all search results for this book