Items related to Design and Analysis of Approximation Algorithms (Springer...

Design and Analysis of Approximation Algorithms (Springer Optimization and Its Applications, Vol. 62) - Hardcover

 
9781461417002: Design and Analysis of Approximation Algorithms (Springer Optimization and Its Applications, Vol. 62)
View all copies of this ISBN edition:
 
 
This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way.

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

From the Back Cover:

When precise algorithmic solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a textbook for a graduate course in theoretical computer science taught globally in universities. It can also be used as a reference work for researchers in the area of design and analysis algorithms.

 

There are few texts available for this standard course, and those that do exist mainly follow a problem-oriented format. This text follows a structured, technique-oriented presentation. Approximation algorithms are organized into chapters based on the design techniques for the algorithms, enabling the reader to study algorithms of the same nature with ease, and providing an improved understanding of the design and analysis techniques for approximation algorithms. Instructors benefit from this approach allowing for an easy way to present the ideas and techniques of algorithms with a unified approach.

About the Author:

Ding-Zhu Du is co-editor of the first and soon-to-be published, second editions, of the Handbook of Combinatorial Optimization. He was also co-author with P.M. Pardalos and W. Wu of the Kluwer publication "Mathematical Theory of Optimization". Du will co-author upcoming Springer publications (2012) entitled "Connected Dominating Set: Theory and Applications" and "Introduction to Combinatorial Optimization". Prof. Du is also the EiC of the Journal of Combinatorial Optimization (Springer).

Ker-I Ko is a well known expert in the field of theoretical computer science. He has authored a single publication with Birkhauser "Computational Complexity of Real Functions" in 1991, with very good reviews. Prof. Du and Ker-I Ko have written several texts together including "Problem Solving in Automata, Languages, and Complexity" John Wiley, 2001; "Theory of Computational Complexity", John Wiley, 2000; Both of these books have received good reviews.

Xiaodong Hu is an expert in combinatorial optimization. He is a member of the editorial boards of Journal of Combinatorial Optimization and Discrete Mathematics, Algorithms and Applications.

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

  • PublisherSpringer
  • Publication date2011
  • ISBN 10 1461417007
  • ISBN 13 9781461417002
  • BindingHardcover
  • Edition number1
  • Number of pages452

Other Popular Editions of the Same Title

9781489998446: Design and Analysis of Approximation Algorithms (Springer Optimization and Its Applications, 62)

Featured Edition

ISBN 10:  ISBN 13:  9781489998446
Publisher: Springer, 2014
Softcover

  • 9781461417026: Design and Analysis of Approximation Algorithms

    Springer, 2011
    Softcover

Top Search Results from the AbeBooks Marketplace

Seller Image

Du, Ding-Zhu", "Ko, Ker-I", "Hu, Xiaodong"
Published by Springer (2011)
ISBN 10: 1461417007 ISBN 13: 9781461417002
New Hardcover Quantity: 10
Seller:
booksXpress
(Bayonne, NJ, U.S.A.)

Book Description Hardcover. Condition: new. Seller Inventory # 9781461417002

More information about this seller | Contact seller

Buy New
US$ 56.50
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds
Stock Image

Du, Ding-Zhu; Ko, Ker-I; Hu, Xiaodong
Published by Springer (2011)
ISBN 10: 1461417007 ISBN 13: 9781461417002
New Hardcover Quantity: > 20
Seller:
Lucky's Textbooks
(Dallas, TX, U.S.A.)

Book Description Condition: New. Seller Inventory # ABLIING23Mar2716030035394

More information about this seller | Contact seller

Buy New
US$ 60.03
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds
Stock Image

Du, Ding-Zhu; Ko, Ker-I; Hu, Xiaodong
Published by Springer (2011)
ISBN 10: 1461417007 ISBN 13: 9781461417002
New Hardcover Quantity: 1
Seller:
GF Books, Inc.
(Hawthorne, CA, U.S.A.)

Book Description Condition: New. Book is in NEW condition. Seller Inventory # 1461417007-2-1

More information about this seller | Contact seller

Buy New
US$ 84.38
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds
Seller Image

Ding-Zhu Du
Published by Springer New York Nov 2011 (2011)
ISBN 10: 1461417007 ISBN 13: 9781461417002
New Hardcover Quantity: 2
Print on Demand
Seller:
BuchWeltWeit Ludwig Meier e.K.
(Bergisch Gladbach, Germany)

Book Description Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way. When exact solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. Even so, there are very few textbooks available for this course. Among those available in the market, most follow a problem-oriented format which is perhaps more convenient for researchers. This text follows a more structured, technique-oriented presentation. Approximation algorithms are organized into different chapters based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature, together. The structure of the text guides the reader to better understanding of the design and analysis techniques for approximation algorithms, and also helps the instructor to present the ideas and techniques of these algorithms in a more unified way.This textbook is intended for graduate students studying theoretical computer science. It can also be used as a reference work for researchers in the area of design and analysis of approximation algorithms. 452 pp. Englisch. Seller Inventory # 9781461417002

More information about this seller | Contact seller

Buy New
US$ 59.57
Convert currency

Add to Basket

Shipping: US$ 24.87
From Germany to U.S.A.
Destination, rates & speeds
Seller Image

Ding-Zhu Du
Published by Springer New York (2011)
ISBN 10: 1461417007 ISBN 13: 9781461417002
New Hardcover Quantity: 1
Seller:
AHA-BUCH GmbH
(Einbeck, Germany)

Book Description Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is intended to be used as a textbook for graduate students studying theoretical computer science. It can also be used as a reference book for researchers in the area of design and analysis of approximation algorithms. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. There are, however, very few textbooks available for this course. Among those available in the market, most books follow a problem-oriented format; that is, they collected many important combinatorial optimization problems and their approximation algorithms, and organized them based on the types, or applications, of problems, such as geometric-type problems, algebraic-type problems, etc. Such arrangement of materials is perhaps convenient for a researcher to look for the problems and algorithms related to his/her work, but is difficult for a student to capture the ideas underlying the various algorithms. In the new book proposed here, we follow a more structured, technique-oriented presentation. We organize approximation algorithms into different chapters, based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature together. It helps the reader to better understand the design and analysis techniques for approximation algorithms, and also helps the teacher to present the ideas and techniques of approximation algorithms in a more unified way. When exact solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a graduate course in theoretical computer science taught widely in the universities, both in the United States and abroad. Even so, there are very few textbooks available for this course. Among those available in the market, most follow a problem-oriented format which is perhaps more convenient for researchers. This text follows a more structured, technique-oriented presentation. Approximation algorithms are organized into different chapters based on the design techniques for the algorithms, so that the reader can study approximation algorithms of the same nature, together. The structure of the text guides the reader to better understanding of the design and analysis techniques for approximation algorithms, and also helps the instructor to present the ideas and techniques of these algorithms in a more unified way.This textbook is intended for graduate students studying theoretical computer science. It can also be used as a reference work for researchers in the area of design and analysis of approximation algorithms. Seller Inventory # 9781461417002

More information about this seller | Contact seller

Buy New
US$ 64.70
Convert currency

Add to Basket

Shipping: US$ 35.67
From Germany to U.S.A.
Destination, rates & speeds
Seller Image

Ding-Zhu Du|Ker-I Ko|Xiaodong Hu
Published by Springer New York (2011)
ISBN 10: 1461417007 ISBN 13: 9781461417002
New Hardcover Quantity: > 20
Print on Demand
Seller:
moluna
(Greven, Germany)

Book Description Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The technique-oriented approach provides a unified view of the design techniques for approximation algorithmsDetailed algorithms, as well as complete proofs and analyses, are presented for each techniqueNumerous examples help the reader to . Seller Inventory # 4197206

More information about this seller | Contact seller

Buy New
US$ 53.87
Convert currency

Add to Basket

Shipping: US$ 52.97
From Germany to U.S.A.
Destination, rates & speeds
Stock Image

Ding-Zhu Du
Published by Springer (2011)
ISBN 10: 1461417007 ISBN 13: 9781461417002
New Hardcover Quantity: 10
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)

Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9781461417002_lsuk

More information about this seller | Contact seller

Buy New
US$ 98.50
Convert currency

Add to Basket

Shipping: US$ 12.59
From United Kingdom to U.S.A.
Destination, rates & speeds
Stock Image

Du, Ding-Zhu/ Ko, Ker-I/ Hu, Xiaodong
Published by Springer Verlag (2011)
ISBN 10: 1461417007 ISBN 13: 9781461417002
New Hardcover Quantity: 1
Print on Demand
Seller:
Revaluation Books
(Exeter, United Kingdom)

Book Description Hardcover. Condition: Brand New. 440 pages. 9.25x6.25x1.25 inches. This item is printed on demand. Seller Inventory # zk1461417007

More information about this seller | Contact seller

Buy New
US$ 119.33
Convert currency

Add to Basket

Shipping: US$ 12.62
From United Kingdom to U.S.A.
Destination, rates & speeds