roba
(prazno)
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...
pročitati sve
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.
sakriti opis- Izdavač: ISTE Ltd and John Wiley & Sons Inc
- Kod:
- Godina izdavanja: 2006
- Jezik: Engleski jezik
- Uvez: Tvrdi
- Broj stranica: 267
- Širina pakiranja: 24.3 cm
- Visina pakiranja: 16.1 cm
- Dubina pakiranja: 2 cm
- Težina pakiranja: 532 g
Recenzije