{"product_id":"probabilistic-combinatorial-optimization-on-graphs","title":"Probabilistic Combinatorial Optimization on Graphs","description":"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.","brand":"EMKA","offers":[{"title":"Default Title","offer_id":57499193540939,"sku":"9781905209330","price":211.21,"currency_code":"EUR","in_stock":true}],"url":"https:\/\/emka.si\/products\/probabilistic-combinatorial-optimization-on-graphs","provider":"EMKA","version":"1.0","type":"link"}