你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Gems of Combinatorial Optimization and Graph Algorithms
Type
Physical Book
Publisher
Author
Language
English
Pages
150
Format
Hardcover
Dimensions
23.4x15.6x1.1 cm
Weight
0.40 kg.
ISBN13
9783319249704
Edition No.
1
Categories

Gems of Combinatorial Optimization and Graph Algorithms

Schulz, Andreas S. ; Skutella, Martin ; Stiller, Sebastian (Author) · Springer · Hardcover

Gems of Combinatorial Optimization and Graph Algorithms - Schulz, Andreas S. ; Skutella, Martin ; Stiller, Sebastian

Cheaper New Book Imported to Taiwan
Delivery: 27 Oct - 09 Nov Shipping: 13 to 17 business days.
NT$ 3,095
Faster New Book Imported to Taiwan
Delivery: 16 Oct - 26 Oct Shipping: 6 to 7 business days.
NT$ 4,070
NT$ 3,095

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Gems of Combinatorial Optimization and Graph Algorithms"

Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar? Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science? Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks. This volume is aimed at readers with some familiarity of combinatorial optimization, and appeals to researchers, graduate students, and advanced undergraduate students alike.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Hardcover.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews