Sciweavers

52
Voted
TALG
2010
48views more  TALG 2010»
14 years 11 months ago
Geodesic delaunay triangulations in bounded planar domains
Steve Oudot, Leonidas J. Guibas, Jie Gao, Yue Wang
55
Voted
TALG
2010
38views more  TALG 2010»
14 years 11 months ago
Ordering by weighted number of wins gives a good ranking for weighted tournaments
Don Coppersmith, Lisa Fleischer, Atri Rudra
73
Voted
TALG
2010
102views more  TALG 2010»
14 years 11 months ago
An approximation algorithm for the maximum leaf spanning arborescence problem
Matthew Drescher, Adrian Vetta
90
Voted
TALG
2010
86views more  TALG 2010»
14 years 11 months ago
Approximating corridors and tours via restriction and relaxation techniques
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
Arturo Gonzalez-Gutierrez, Teofilo F. Gonzalez
79
Voted
TALG
2010
82views more  TALG 2010»
14 years 11 months ago
A near-optimal algorithm for estimating the entropy of a stream
Amit Chakrabarti, Graham Cormode, Andrew McGregor
87
Voted
TALG
2010
52views more  TALG 2010»
14 years 11 months ago
Approximating the distance to monotonicity in high dimensions
Shahar Fattal, Dana Ron
69
Voted
TALG
2010
68views more  TALG 2010»
14 years 11 months ago
A fast algorithm to generate open meandric systems and meanders
Bruce A. Bobier, Joe Sawada
109
Voted
TALG
2010
101views more  TALG 2010»
14 years 11 months ago
Reasoning about online algorithms with weighted automata
We describe an automata-theoretic approach for the competitive analysis of online algorithms. Our approach is based on weighted automata, which assign to each input word a cost in...
Benjamin Aminof, Orna Kupferman, Robby Lampert
88
Voted
TALG
2010
110views more  TALG 2010»
14 years 11 months ago
Approximating fractional hypertree width
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
Dániel Marx
96
Voted
TALG
2010
73views more  TALG 2010»
14 years 11 months ago
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
We present two new algorithms for finding optimal strategies for discounted, infinite-horizon, Deterministic Markov Decision Processes (DMDP). The first one is an adaptation of...
Omid Madani, Mikkel Thorup, Uri Zwick