SODA 2001 - PDF Preprint Papers

SODA 2001 Symposium on Discrete Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed SODA-2001 Paper

click to vote

SODA
2001
ACM

188views Algorithms» more SODA 2001»

Approximation algorithms for the 0-extension problem

14 years 24 days ago

Download www.cs.technion.ac.il

In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...

Gruia Calinescu, Howard J. Karloff, Yuval Rabani

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	188	Approximation algorithms for the 0-extension problem	claim
2	166	Better approximation algorithms for bin covering	claim
3	163	Algorithms for facility location problems with outliers	claim
4	157	New approaches to covering and packing problems	claim
5	150	A faster implementation of the Goemans-Williamson clustering algorithm	claim
6	147	Sublinear time approximate clustering	claim
7	144	Representing dynamic binary trees succinctly	claim
8	138	The diameter of random massive graphs	claim
9	126	Static and kinetic geometric spanners with applications	claim
10	125	Parallel processor scheduling with delay constraints	claim
11	115	Loss-bounded analysis for differentiated services	claim
12	114	Approximation algorithms for TSP with neighborhoods in the plane	claim
13	110	Improved approximation algorithms for rectangle tiling and packing	claim
14	110	IMproved results for route planning in stochastic transportation	claim
15	110	Absolute convergence: true trees from short sequences	claim
16	109	Competitive auctions and digital goods	claim
17	108	Entropy-preserving cuttings and space-efficient planar point location	claim
18	108	Approximating coloring and maximum independent sets in 3-uniform hypergraphs	claim
19	105	Online point location in planar arrangements and its applications	claim
20	103	Dynamic skin triangulation	claim
21	103	Reductions among high dimensional proximity problems	claim
22	102	The probabilistic relationship between the assignment and asymmetric traveling salesman problems	claim
23	102	Approximate majorization and fair online load balancing	claim
24	100	Linear reductions of maximum matching	claim
25	100	Practical approximation algorithms for zero- and bounded-skew trees	claim
26	99	Fast implementation of depth contours using topological sweep	claim
27	97	An efficient algorithm for the configuration problem of dominance graphs	claim
28	94	A simple entropy-based algorithm for planar point location	claim
29	94	Computing the depth of a flat	claim
30	93	Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction	claim
31	93	Making data structures confluently persistent	claim
32	93	Distributed admission control, scheduling, and routing with stale information	claim
33	92	On universally easy classes for NP-complete problems	claim
34	90	Internet packet filter management and rectangle geometry	claim
35	88	Faster kinetic heaps and their use in broadcast scheduling	claim
36	87	Random lifts of graphs	claim
37	87	A linear lower bound on index size for text retrieval	claim
38	87	Steiner points in tree metrics don't (really) help	claim
39	87	Gossip is synteny: incomplete gossip and an exact algorithm for syntenic distance	claim
40	86	Pattern matching for sets of segments	claim
41	81	A probabilistic analysis of a greedy algorithm arising from computational biology	claim
42	80	On the discrete Bak-Sneppen model of self-organized criticality	claim
43	79	Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining	claim
44	79	Learning Markov networks: maximum bounded tree-width graphs	claim
45	79	On polynomial approximation to the shortest lattice vector length	claim
46	77	Distance labeling in graphs	claim
47	70	Web caching using access statistics	claim
48	69	Stability preserving transformations: packet routing networks with edge capacities and speeds	claim
49	69	Guessing secrets	claim
50	69	Fast approximation of centrality	claim
51	67	Reconstructing a collection of curves with corners and endpoints	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers