T HEORY OF C OMPUTING, Volume[removed]), pp. 179–195 http: theoryofcomputing.org Approximation Algorithms and Online Mechanisms for Item Pricing∗ Maria-Florina Balcan† - Feedback arc set - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2007-09-27 01:28:53 NP-complete problems Graph theory Approximation algorithm Hypergraph Time complexity Vertex cover Feedback arc set Theoretical computer science Computational complexity theory Applied mathematics		T HEORY OF C OMPUTING, Volume[removed]), pp. 179–195 http://theoryofcomputing.org Approximation Algorithms and Online Mechanisms for Item Pricing∗ Maria-Florina Balcan† Add to Reading List Source URL: www.cs.cmu.edu Download Document from Source Website File Size: 186,94 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