Recent Advances in Algorithms and Combinatorics
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 ma...
Συγγραφή απο Οργανισμό/Αρχή: | |
---|---|
Άλλοι συγγραφείς: | , |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
New York, NY :
Springer New York : Imprint: Springer,
2003.
|
Σειρά: | CMS Books in Mathematics / Ouvrages de mathématiques de la SMC,
|
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 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.