APPROX 2009 - PDF Preprint Papers

APPROX 2009 International Workshop on Approximation Algorithms for

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed APPROX-2009 Paper

click to vote

APPROX
2009
Springer

195views Algorithms» more APPROX 2009»

Approximating Node-Connectivity Augmentation Problems

14 years 7 months ago

Download www.openu.ac.il

The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, ﬁnd a minimum size set I of n...

Zeev Nutov

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	195	Approximating Node-Connectivity Augmentation Problems	claim
2	177	Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems	claim
3	163	The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders	claim
4	156	Small-Bias Spaces for Group Products	claim
5	156	An Analysis of Random-Walk Cuckoo Hashing	claim
6	153	Average-Case Analyses of Vickrey Costs	claim
7	149	On the Complexity of the Asymmetric VPN Problem	claim
8	145	Approximating Some Network Design Problems with Node Costs	claim
9	142	Optimal Sherali-Adams Gaps from Pairwise Independence	claim
10	142	Truthful Mechanisms via Greedy Iterative Packing	claim
11	139	Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs	claim
12	138	Submodular Maximization over Multiple Matroids via Generalized Exchange Properties	claim
13	137	Testing Computability by Width Two OBDDs	claim
14	136	Succinct Representation of Codes with Applications to Testing	claim
15	135	Tolerant Linearity Testing and Locally Testable Codes	claim
16	131	An Approximation Scheme for Terrain Guarding	claim
17	129	Baum's Algorithm Learns Intersections of Halfspaces with Respect to Log-Concave Distributions	claim
18	126	Improved Inapproximability Results for Maximum k-Colorable Subgraph	claim
19	126	On Hardness of Pricing Items for Single-Minded Bidders	claim
20	125	Minimizing Average Shortest Path Distances via Shortcut Edge Addition	claim
21	118	Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND	claim
22	115	Small Clique Detection and Approximate Nash Equilibria	claim
23	112	Deterministic Approximation Algorithms for the Nearest Codeword Problem	claim
24	108	Strong Parallel Repetition Theorem for Free Projection Games	claim
25	107	Hierarchy Theorems for Property Testing	claim
26	107	Approximations for Aligned Coloring and Spillage Minimization in Interval and Chordal Graphs	claim
27	107	Extractors Using Hardness Amplification	claim
28	105	Real-Time Message Routing and Scheduling	claim
29	104	A Hypergraph Dictatorship Test with Perfect Completeness	claim
30	104	Improved Polynomial Identity Testing for Read-Once Formulas	claim
31	104	Scheduling with Outliers	claim
32	99	Resource Minimization Job Scheduling	claim
33	98	On the Security of Goldreich's One-Way Function	claim
34	98	Random Tensors and Planted Cliques	claim
35	96	On the Optimality of Gluing over Scales	claim
36	93	PASS Approximation	claim
37	87	Pseudorandom Bit Generators That Fool Modular Sums	claim
38	85	Algorithmic Aspects of Property Testing in the Dense Graphs Model	claim
39	85	Pseudorandom Generators and Typically-Correct Derandomization	claim
40	80	The Glauber Dynamics for Colourings of Bounded Degree Trees	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers