Journal of Complex Networks, 177–186 doi:comnet cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind† - Clique cover - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2016-07-01 10:19:11 NP-complete problems Clique problem Vertex cover Clique Independent set Bipartite graph Travelling salesman problem Graph coloring Line graph Treewidth Pathwidth		Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind† Add to Reading List Source URL: www.levreyzin.com Download Document from Source Website File Size: 236,71 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