Logo - springer
Slogan - springer

New & Forthcoming Titles | Building Bridges - Between Mathematics and Computer Science

Building Bridges

Between Mathematics and Computer Science

Grötschel, Martin, Katona, Gyula O.H. (Eds.)

2008

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$119.00

(net) price for USA

ISBN 978-3-540-85221-6

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$159.00

(net) price for USA

ISBN 978-3-540-85218-6

free shipping for individuals worldwide

The book title is in reprint. You can already preorder it.


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$159.00

(net) price for USA

ISBN 978-3-642-09896-3

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • An exceptional collection of papers published on the occasion of László Lovász' 60th birthday in August 2008
  • Contributions by experts in discrete mathematics, set theory, probabilistic methods and stochastic structures, theoretical computer science
  • The book contains excellent survey papers and genuine research papers all related to the joint work of the authors with L. Lovász

Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is László Lovász, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovász’s 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers.

Content Level » Research

Keywords » Combinatorics - Computer - Graph - Graphs - Hypergraphs - Matching - Node - Random structures - Set theory - computer science - finite field - theoretical computer science

Related subjects » Number Theory and Discrete Mathematics - Theoretical Computer Science

Table of contents 

On the Power of Linear Dependencies.- Surplus of Graphs and the Lovász Local Lemma.- Deformable Polygon Representation and Near-Mincuts.- Variations for Lovász’ Submodular Ideas.- Random Walks, Arrangements, Cell Complexes, Greedoids, and Self-Organizing Libraries.- The Finite Field Kakeya Problem.- An Abstract Szemerédi Regularity Lemma.- Isotropic PCA and Affine-Invariant Clustering.- Small Linear Dependencies for Binary Vectors of Low Weight.- Plünnecke’s Inequality for Different Summands.- Decoupling and Partial Independence.- Combinatorial Problems in Chip Design.- Structural Properties of Sparse Graphs.- Recent Progress in Matching Extension.- The Structure of the Complex of Maximal Lattice Free Bodies for a Matrix of Size (n + 1) × n.- Graph Invariants in the Edge Model.- Incidences and the Spectra of Graphs.- The Maturation of the Probabilistic Method.- A Structural Approach to Subset-Sum Problems.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Combinatorics.