Matching theory - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-02-11 03:59:44 Combinatorial optimization NP-complete problems Matching Cut Shortest path problem Time complexity Maximum cut Travelling salesman problem Hungarian algorithm Theoretical computer science Graph theory Mathematics		Add to Reading List Source URL: web.eecs.umich.edu Download Document from Source Website File Size: 620,37 KB Share Document on Facebook

	Bandit based Monte-Carlo Planning Levente Kocsis and Csaba Szepesv´ari Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u, 1111 Budapest, Hungary DocID: 1pGal - View Document
	Weighted Synergy Graphs for Role Assignment in Ad Hoc Heterogeneous Robot Teams Somchaya Liemhetcharat and Manuela Veloso School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA a DocID: 1phC2 - View Document
	123 Documenta Math. Discrete Optimization Stories DocID: 1p15X - View Document
	Fine-Grained Complexity and Algorithm Design Boot Camp Parameterized Reductions Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) DocID: 1muZB - View Document