towar
(pusty)
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...
przeczytaj całość
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.
ukryj opis- Wydawnictwo: ISTE Ltd and John Wiley & Sons Inc
- Kod:
- Rok wydania: 2006
- Język: Angielski
- Oprawa: Twarda
- Liczba stron: 267
- Szerokość opakowania: 24.3 cm
- Wysokość opakowania: 16.1 cm
- Głębokość opakowania: 2 cm
- Waga: 532 g
Recenzja