Graph Theory, Combinatorics and Algorithms : Interdisciplinary Applications
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by exp...
Сохранить в:
| Другие авторы: | , |
|---|---|
| Формат: | Livre numérique |
| Язык: | Anglais |
| Опубликовано: |
Boston, MA :
Springer US
[20..].
Cham : Springer Nature |
| Серии: | Operations Research/Computer Science Interfaces Series
34 |
| Online-ссылка: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Примечание: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Graph theory, combinatorics, and algorithms, interdisciplinary applications, edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman, New York, Springer, 2005, 1 vol. (IX-292 p.), 0-387-24347-X |
Оглавление:
- Optimization Problems Related to Internet Congestion Control Problems in Data Structures and Algorithms Algorithmic Graph Theory and Its Applications Decompositions and Forcing Relations in Graphs and Other Combinatorial Structures The Local Ratio Technique and Its Application to Scheduling and Resource Allocation Problems Domination Analysis of Combinatorial Optimization Algorithms and Problems On Multi-Object Auctions and Matching Theory: Algorithmic Aspects Strategies for Searching Graphs Recent Trends in Arc Routing Software and Hardware Testing Using Combinatorial Covering Suites Incidences