Algorithms | Sciweavers

35

SODA
2001
ACM

87views Algorithms» more SODA 2001»

Steiner points in tree metrics don't (really) help

13 years 11 months ago

Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...

Anupam Gupta

claim paper

Read More »

24

click to vote

SODA
2001
ACM

109views Algorithms» more SODA 2001»

Competitive auctions and digital goods

13 years 11 months ago

Download www.cs.miami.edu

Andrew V. Goldberg, Jason D. Hartline, Andrew Wrig...

claim paper

Read More »

18

click to vote

SODA
2001
ACM

93views Algorithms» more SODA 2001»

Distributed admission control, scheduling, and routing with stale information

13 years 11 months ago

Download www.cs.ucla.edu

Ashish Goel, Adam Meyerson, Serge A. Plotkin

claim paper

Read More »

20

click to vote

SODA
2001
ACM

102views Algorithms» more SODA 2001»

Approximate majorization and fair online load balancing

13 years 11 months ago

Download www.cs.ucla.edu

This paper relates the notion of fairness in online routing and load balancing to vector majorization as developed by Hardy, Littlewood, and Polya 9]. We de ne -supermajorization ...

Ashish Goel, Adam Meyerson, Serge A. Plotkin

claim paper

Read More »

21

click to vote

SODA
2001
ACM

103views Algorithms» more SODA 2001»

Reductions among high dimensional proximity problems

13 years 11 months ago

Download graphics.stanford.edu

Ashish Goel, Piotr Indyk, Kasturi R. Varadarajan

claim paper

Read More »

21

click to vote

SODA
2001
ACM

77views Algorithms» more SODA 2001»

Distance labeling in graphs

13 years 11 months ago

Download www.wisdom.weizmann.ac.il

Cyril Gavoille, David Peleg, Stephane Perennes, Ra...

claim paper

Read More »

29

click to vote

SODA
2001
ACM

67views Algorithms» more SODA 2001»

Reconstructing a collection of curves with corners and endpoints

13 years 11 months ago

Download stubber.math-inf.uni-greifswald.de

We present an algorithm which provably reconstructs a collection of curves with corners and endpoints from a sample set that satisfies a certain sampling condition. The algorithm ...

Stefan Funke, Edgar A. Ramos

claim paper

Read More »

24

click to vote

SODA
2001
ACM

102views Algorithms» more SODA 2001»

The probabilistic relationship between the assignment and asymmetric traveling salesman problems

13 years 11 months ago

Download www.math.cmu.edu

Alan M. Frieze, Gregory B. Sorkin

claim paper

Read More »

29

click to vote

SODA
2001
ACM

93views Algorithms» more SODA 2001»

Making data structures confluently persistent

13 years 11 months ago

Download www.math.tau.ac.il

We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...

Amos Fiat, Haim Kaplan

claim paper

Read More »

20

click to vote

SODA
2001
ACM

69views Algorithms» more SODA 2001»

Fast approximation of centrality

13 years 11 months ago