APPROX 2005 - PDF Preprint Papers

APPROX 2005 International Workshop on Approximation Algorithms for

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APPROX-2005 Paper

click to vote

APPROX
2005
Springer

150views Algorithms» more APPROX 2005»

A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses

13 years 10 months ago

Download www.mpi-inf.mpg.de

We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...

Julián Mestre

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	150	A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses	claim
2	136	What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization	claim
3	131	Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems	claim
4	122	Finding a Maximum Independent Set in a Sparse Random Graph	claim
5	114	Finding Graph Matchings in Data Streams	claim
6	111	Sampling Bounds for Stochastic Optimization	claim
7	111	A Lower Bound on List Size for List Decoding	claim
8	106	Derandomized Constructions of k-Wise (Almost) Independent Permutations	claim
9	106	Approximating the Bandwidth of Caterpillars	claim
10	105	The Complexity of Making Unique Choices: Approximating 1-in- k SAT	claim
11	104	Bounds for Error Reduction with Few Quantum Queries	claim
12	104	On the Error Parameter of Dispersers	claim
13	103	Where's the Winner? Max-Finding and Sorting with Metric Costs	claim
14	99	Beating a Random Assignment	claim
15	96	Tolerant Locally Testable Codes	claim
16	96	Derandomized Squaring of Graphs	claim
17	95	Approximation Algorithms for Requirement Cut on Graphs	claim
18	94	Testing Periodicity	claim
19	93	Fractional Decompositions of Dense Hypergraphs	claim
20	90	Tight Bounds for String Reconstruction Using Substring Queries	claim
21	88	Approximating the Best-Fit Tree Under Lp Norms	claim
22	84	The Tensor Product of Two Codes Is Not Necessarily Robustly Testable	claim
23	80	On Learning Random DNF Formulas Under the Uniform Distribution	claim
24	79	Reconstructive Dispersers and Hitting Set Generators	claim
25	75	The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem	claim
26	73	Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints	claim
27	71	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers