Recent Advances in Algorithms and Combinatorics

Softcover Nachdruck of the original 1. Auflage 2003
ISBN: 978-1-4684-9268-2
Verlag: Springer

Buch, Englisch, 352 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 557 g

Reihe: CMS Books in Mathematics

Combinatorics is one of the fastest growing ?elds of mathematics. In large measure this is because many practical problems can be modeled and then e?ciently 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 nodirectapplicationtoappliedproblems. Inthisvolumewehighlightsome exciting recent developments in algorithmic combinatorics. Most practical applications of algorithmic combinatorics would be - possible without the use of the computer. As computers become ever more powerful, more and more applications become possible. Computational biology is one example of a relatively new ?eld in which algorithmic c- binatorics plays a key role. The chapter by Sagot and Wakabayashi in this volumediscusseshowcombinatorialtoolscanbeusedtosearchforpatterns in DNA and protein sequences. The information technology revolution has not only allowed for the r- olution of practical problems using combinatorial techniques, it has also been the source of many new combinatorial problems. One example is - dio channel assignment. In this problem we have a number of transmitters each of which must handle a number of calls. Each call must be assigned a frequency in such a way that interference is avoided (thus calls handled by the same transmitter are assigned di?erent frequencies as are calls handled by transmitters which are near each other). The explosive growth in the use of the frequency spectrum due to, e. g., mobile telephone networks, has made it a very valuable resource.

Zielgruppe

Research

Autoren/Hrsg.

Linhares-Sales, Claudia L.

Reed, Bruce A.

Inhaltsverzeichnis

The Matching Lattice.- Discrete Mathematics and Radio Channel Assignment.- On the coloration of perfect graphs.- Algorithmic Aspects of Tree Width.- A Survey on Clique Graphs.- Semidefinite Programs and Combinatorial Optimization.- Approximability of NP-Optimization Problems.- Pattern Inference under many Guises.- Szemerédi’s Regularity Lemma and Quasi-randomness.