The importance of being biased

14 years 5 months ago

Download www.cs.cmu.edu

The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this problem to within any factor smaller than 10

Irit Dinur, Shmuel Safra

Real-time Traffic

Algorithms | STOC 2002 | Vertex Cover Problem |

claim paper

» Effective Born radii in the generalized Born approximation The importance of being perfect

» The importance of being overheard throughput gains in wireless mesh networks

» Adaptive XML Storage or The Importance of Being Lazy

» On the Importance of Being Quantum

» On the WellBehavedness of Important Attribute Evaluation Functions

» Information theoretic bounds on neural prosthesis effectiveness The importance of spike so...

» Bias of Importance Measures for Multivalued Attributes and Solutions

» Unsupervised WSD based on Automatically Retrieved Examples The Importance of Bias

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2002
Where	STOC
Authors	Irit Dinur, Shmuel Safra

Comments (0)

Sciweavers

The importance of being biased

Algorithms | STOC 2002 | Vertex Cover Problem |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers