APPROX 2006 - PDF Preprint Papers

APPROX 2006 International Workshop on Approximation Algorithms for

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APPROX-2006 Paper

click to vote

APPROX
2006
Springer

234views Algorithms» more APPROX 2006»

Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs

13 years 8 months ago

Download www.cs.le.ac.uk

For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...

Christoph Ambühl, Thomas Erlebach, Matú...

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	234	Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs	claim
2	188	Maintaining External Memory Efficient Hash Tables	claim
3	179	Adaptive Sampling and Fast Low-Rank Matrix Approximation	claim
4	179	On Bounded Distance Decoding for General Lattices	claim
5	162	Approximating Precedence-Constrained Single Machine Scheduling by Coloring	claim
6	130	Tight Results on Minimum Entropy Set Cover	claim
7	130	Robust Mixing	claim
8	126	Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems	claim
9	126	Better Approximations for the Minimum Common Integer Partition Problem	claim
10	124	Combinatorial Algorithms for Data Migration to Minimize Average Completion Time	claim
11	121	Subspace Sampling and Relative-Error Matrix Approximation: Column-Based Methods	claim
12	121	A Randomized Solver for Linear Systems with Exponential Convergence	claim
13	120	Single-Source Stochastic Routing	claim
14	120	Approximating Average Parameters of Graphs	claim
15	117	Fractional Matching Via Balls-and-Bins	claim
16	114	Stochastic Combinatorial Optimization with Controllable Risk Aversion Level	claim
17	110	Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees	claim
18	109	Dobrushin Conditions and Systematic Scan	claim
19	107	A Fast Random Sampling Algorithm for Sparsifying Matrices	claim
20	106	A Tight Lower Bound for the Steiner Point Removal Problem on Trees	claim
21	105	Monotone Circuits for the Majority Function	claim
22	105	Space Complexity vs. Query Complexity	claim
23	103	Approximation Algorithms for Graph Homomorphism Problems	claim
24	100	Robust Local Testability of Tensor Products of LDPC Codes	claim
25	92	Improved Algorithms for Data Migration	claim
26	91	Threshold Functions for Asymmetric Ramsey Properties Involving Cliques	claim
27	90	Complete Convergence of Message Passing Algorithms for Some Satisfiability Problems	claim
28	89	Online Algorithms to Minimize Resource Reallocations and Network Communication	claim
29	88	Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs	claim
30	79	On Nontrivial Approximation of CSPs	claim
31	76	Distance Approximation in Bounded-Degree and General Sparse Graphs	claim
32	72	An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs	claim
33	72	Local Decoding and Testing for Homomorphisms	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers