Amazon cover image
Image from Amazon.com

Recent advances in algorithms and combinatorics

By: Contributor(s): Material type: TextTextLanguage: English Series: CMS books in mathematics ; 11Publication details: New York Springer 2003Description: xiii, 351p. illISBN:
  • 0387954341 (HB)
Subject(s):
Contents:
Chapter 1: The Matching Lattice Authors: M.H. de Carvalho, C.L. Lucchesi, U.S.R. Murty​ Chapter 2: Discrete Mathematics and Radio Channel Assignment Author: C. McDiarmid​ Chapter 3: On the Coloration of Perfect Graphs Author: F. Maffray​ Chapter 4: Algorithmic Aspects of Tree Width Author: B.A. Reed​ Chapter 5: A Survey on Clique Graphs Author: J.L. Szwarcfiter​ Chapter 6: Semidefinite Programs and Combinatorial Optimization Author: L. Lovasz​ Chapter 7: Approximability of NP-Optimization Problems Author: A. Steger​ Chapter 8: Pattern Inference Under Many Guises Authors: M.F. Sagot, Y. Wakabayashi​ Chapter 9: Szemeredi's Regularity Lemma and Quasi-Randomness Authors: Y. Kohayakawa, V. Rodl​
Summary: Combinatorics is one of the fastest growing fields of mathematics. One reason for this is because many practical problems can be modeled and then efficiently solved using combinatorial theory. This real world motivation for studying algorithmic combinatorics has led not only to the development of many software packages but also to some beautiful mathematics which has no direct application to applied problems.
Item type: BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified Status Date due Barcode
IMSc Library 519.1 REE (Browse shelf(Opens below)) Available 50409

Includes index

Includes bibliographical references

Chapter 1: The Matching Lattice
Authors: M.H. de Carvalho, C.L. Lucchesi, U.S.R. Murty​

Chapter 2: Discrete Mathematics and Radio Channel Assignment
Author: C. McDiarmid​

Chapter 3: On the Coloration of Perfect Graphs
Author: F. Maffray​

Chapter 4: Algorithmic Aspects of Tree Width
Author: B.A. Reed​

Chapter 5: A Survey on Clique Graphs
Author: J.L. Szwarcfiter​

Chapter 6: Semidefinite Programs and Combinatorial Optimization
Author: L. Lovasz​


Chapter 7: Approximability of NP-Optimization Problems
Author: A. Steger​

Chapter 8: Pattern Inference Under Many Guises
Authors: M.F. Sagot, Y. Wakabayashi​

Chapter 9: Szemeredi's Regularity Lemma and Quasi-Randomness
Authors: Y. Kohayakawa, V. Rodl​

Combinatorics is one of the fastest growing fields of mathematics. One reason for this is because many practical problems can be modeled and then efficiently solved using combinatorial theory. This real world motivation for studying algorithmic combinatorics has led not only to the development of many software packages but also to some beautiful mathematics which has no direct application to applied problems.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India