45 search results - page 6 / 9 » talg 2008 |
TALG
2008
13 years 10 months ago
2008
The Fibonacci heap was devised to provide an especially efficient implementation of Dijkstra's shortest path algorithm. Although asyptotically efficient, it is not as fast in...
TALG
2008
13 years 10 months ago
2008
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
TALG
2010
13 years 9 months ago
2010
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...
TALG
2008
13 years 10 months ago
2008
In this paper, we study the metrics of negative type, which are metrics (V, d) such that d is an Euclidean metric; these metrics are thus also known as " 2-squared" met...
TALG
2010
13 years 9 months ago
2010
We introduce a facility location problem with submodular facility cost functions, and give an O(log n) approximation algorithm for it. Then we focus on a special case of submodula...