SODA 2001 | Sciweavers

12

click to vote

SODA
2001
ACM

108views Algorithms» more SODA 2001»

Approximating coloring and maximum independent sets in 3-uniform hypergraphs

13 years 6 months ago

Download www.math.ucla.edu

Michael Krivelevich, Ram Nathaniel, Benny Sudakov

claim paper

Read More »

17

click to vote

SODA
2001
ACM

115views Algorithms» more SODA 2001»

Loss-bounded analysis for differentiated services

13 years 6 months ago

Download www.math.tau.ac.il

We consider a network providing Differentiated Services (DiffServ) which allow network service providers to offer different levels of Quality of Service (QoS) to different traffic...

Alexander Kesselman, Yishay Mansour

claim paper

Read More »

12

click to vote

SODA
2001
ACM

79views Algorithms» more SODA 2001»

Learning Markov networks: maximum bounded tree-width graphs

13 years 6 months ago

Download www.biostat.wisc.edu

Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...

David R. Karger, Nathan Srebro

claim paper

Read More »

15

click to vote

SODA
2001
ACM

126views Algorithms» more SODA 2001»

Static and kinetic geometric spanners with applications

13 years 6 months ago

Download www.tem.uoc.gr

It is well known that the Delaunay Triangulation is a spanner graph of its vertices. In this paper we show that any bounded aspect ratio triangulation in two and three dimensions ...

Menelaos I. Karavelas, Leonidas J. Guibas

claim paper

Read More »

7

click to vote

SODA
2001
ACM

88views Algorithms» more SODA 2001»

Faster kinetic heaps and their use in broadcast scheduling

13 years 6 months ago

Download www.cs.princeton.edu

Haim Kaplan, Robert Endre Tarjan, Kostas Tsioutsio...

claim paper

Read More »

8

click to vote

SODA
2001
ACM

79views Algorithms» more SODA 2001»

Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining

13 years 6 months ago

Download lcbb.epfl.ch

Katherine St. John, Tandy Warnow, Bernard M. E. Mo...

claim paper

Read More »

12

click to vote

SODA
2001
ACM

105views Algorithms» more SODA 2001»

Online point location in planar arrangements and its applications

13 years 6 months ago

Download valis.cs.uiuc.edu

Recently, Har-Peled [HP99b] presented a new randomized technique for online construction of the zone of a curve in a planar arrangement of arcs. In this paper, we present several ...

Sariel Har-Peled, Micha Sharir

claim paper

Read More »

11

click to vote

SODA
2001
ACM

87views Algorithms» more SODA 2001»

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

13 years 6 months ago

Download www.cs.cmu.edu

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 »

11

click to vote

SODA
2001
ACM

109views Algorithms» more SODA 2001»

Competitive auctions and digital goods

13 years 6 months ago