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

Source URL: users.ics.aalto.fi

Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Marek Karpinski∗ Richard Schmied†

Source URL: theory.cs.uni-bonn.de

Algorithmica DOIs00453Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms Athanassios Koutsonas · Dimitrios M. Thilikos

Source URL: users.uoa.gr

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

Source URL: users.uoa.gr

A simple local 3-approximation algorithm for vertex cover

Source URL: www.dcg.ethz.ch

Welcome bidimensional problems, which includes many domination and covering problems such as vertex cover, feedFrances Rosamond, Editor, Charles Darwin University back vertex set, minimum maximal matching, and more. The

Source URL: fpt.wdfiles.com

Set Covering with Ordered Replacement: Additive and Multiplicative Gaps Friedrich Eisenbrand1 , Naonori Kakimura?2 , Thomas Rothvoß??1 , and Laura Sanità? ? ?1 1

Source URL: www.math.washington.edu

• Mathematics
• Computational complexity theory
• Algebra
• NP-complete problems
• Analysis of algorithms
• Set cover problem
• Bin packing problem
• Linear programming relaxation
• Vertex cover
• Ring
• Exponentiation
• Big O notation

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Source URL: resources.mpi-inf.mpg.de

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Packing problems
• Operations research
• Approximation algorithms
• Knapsack problem
• Vertex cover
• Bin packing problem
• Hardness of approximation
• Algorithm

SET COVERING WITH OUR EYES CLOSED∗ FABRIZIO GRANDONI† , ANUPAM GUPTA‡ , STEFANO LEONARDI§ , PAULI MIETTINEN¶, PIOTR SANKOWSKI§ k , AND MOHIT SINGH∗∗ Abstract. Given a universe U of n elements and a weighted

Source URL: people.mpi-inf.mpg.de

• Computational complexity theory
• Mathematics
• NP-complete problems
• Theory of computation
• Set cover problem
• Approximation algorithm
• Algorithm
• Analysis of algorithms
• Bin packing problem
• Vertex cover

comput. complex), 281 – 040281–27 DOIs00037c Birkh¨

Source URL: www.cs.huji.ac.il

• Computational complexity theory
• Graph theory
• NP-complete problems
• Mathematics
• Travelling salesman problem
• Set TSP problem
• Steiner tree problem
• Vertex cover
• Approximation algorithm
• APX
• Cut
• Time complexity