On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´

First Page		Document Content
Date: 2014-08-22 14:44:58 Graph theory Mathematics Spanning tree Operations research NP-complete problems Dynamic programming Equations Systems engineering Vertex cover Minimum spanning tree		On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´ Add to Reading List Source URL: orion.math.iastate.edu Download Document from Source Website File Size: 498,16 KB Share Document on Facebook

	Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks Jukka Suomela Helsinki Institute for Information Technology HIIT University of Helsinki, Finland DocID: 1uD6Y - View Document
	Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Marek Karpinski∗ Richard Schmied† DocID: 1uqnU - View Document
	Algorithmica DOIs00453Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms Athanassios Koutsonas · Dimitrios M. Thilikos DocID: 1t5yD - View Document
	Discrete Applied Mathematics – 245 www.elsevier.com/locate/dam Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover Naomi Nishimuraa,1 , Prabhakar Ragdea,1 , Dimitrios DocID: 1t33V - View Document
	A simple local 3-approximation algorithm for vertex cover DocID: 1sHQB - View Document