Probabilistic Combinatorial Optimization on Graphs

Cecile Murat, Vangelis Th. Paschos · ISTE Ltd and John Wiley & Sons Inc · 2006
This title provides a comprehensive survey over the subject of probabilistic combinatorial optimization, discussing probabilistic versions of some of the most paradigmatic combinatorial problems on graphs, such as the maximum independent set, the minimum vertex covering, the longest path and the minimum coloring.
Those who possess a sound knowledge of the subject mater will find the title of great interest, but those who have only some mathematical familiarity and knowledge about complexity and approximation theory will also find it an accessible and informative read.
Saadavus
210,00 €
Uus kasutamata raamat
Täna tellides on tarneaeg umbes 10 päeva (27.11.2026)Tellimuse täitmise aeg on umbkaudne ja sõltub nädalapäevast, millal tellimus tehakse. Reeglina ei kulu üle kahe nädala.
Detailid
- Autorid
- Cecile Murat, Vangelis Th. Paschos
- ISBN
- 9781905209330
- Aasta
- 2006
- Kirjastus
- ISTE Ltd and John Wiley & Sons Inc
- Keel
- inglise
- Köide
- Kõva kaas
- Lehekülgi
- 267
- Teema
- Matemaatika ja loodusteadused › Matemaatika — Mathematics
- Kaal
- 532 g