Probabilistic Combinatorial Optimization on Graphs

ISBN: 9781905209330

出版社: Paul & Co Pub Consortium

页数: 267

定价: $ 141.25

装帧: HRD

内容简介

This comprehensive survey requires only some mathematical understanding and knowledge about complexity and approximation theory and covers some of the most paradigmatic combinatorial problems on graphs, such as the maximum-independent set, minimum-vertex covering, longest path, and minimum coloring.