<--- Back to Details
First PageDocument Content
2-satisfiability / True quantified Boolean formula / Connectivity / SL / NP-complete problems / Matching / Vertex cover / Skew-symmetric graph / Theoretical computer science / Mathematics / Graph theory
Date: 2007-04-16 00:53:37
2-satisfiability
True quantified Boolean formula
Connectivity
SL
NP-complete problems
Matching
Vertex cover
Skew-symmetric graph
Theoretical computer science
Mathematics
Graph theory

Add to Reading List

Source URL: www.math.ucsd.edu

Download Document from Source Website

File Size: 473,12 KB

Share Document on Facebook

Similar Documents

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