Mohlo by se vám také líbit

Více informací o knize Connections in Combinatorial Optimization

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 576 bodů

Anotace knihy

Graph connectivities and submodular functions are two widely applied and fast developing fields of combinatorial optimization. This book not only includes the most recent results, but also highlights several surprising connections between diverse topics within combinatorial optimization. It offers a unified treatment of developments in the concepts and algorithmic methods of the area, starting from basic results on graphs, matroids and polyhedral combinatorics, through the advanced topics of connectivity issues of graphs and networks, to the abstract theory and applications of submodular optimization. Difficult theorems and algorithms are made accessible to graduate students in mathematics, computer science, operations research, informatics and communication. The book is not only a rich source of elegant material for an advanced course in combinatorial optimization, but it also serves as a reference for established researchers by providing efficient tools for applied areas like infocommunication, electric networks and structural rigidity.

Parametry knihy

Zařazení knihy Knihy v angličtině Computing & information technology Computer science Mathematical theory of computation

• Plný název: Connections in Combinatorial Optimization
• Autor: Andras Frank
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 664
• EAN: 9780199205271
• ISBN: 0199205272
• ID: 04529415
• Nakladatelství: Oxford University Press
• Hmotnost: 1088 g
• Rozměry: 232 × 156 × 41 mm
• Datum vydání: 24. February 2011

Oblíbené z jiného soudku

---

---

---