7006 search results - page 228 / 1402 » Approximation Algorithms |
120
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
115
Voted
CAD
2002
Springer
15 years 3 months ago
2002
Springer
A general discussion of the including approximation of a curve by a fat arc is given followed by an algorithm for constructing an including fat arc for a parametric Be
127
click to vote
SODA
2003
ACM
15 years 4 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
118
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
Indicator-based algorithms have become a very popular approach to solve multi-objective optimization problems. In this paper, we contribute to the theoretical understanding of alg...
154
Voted
UAI
2000
15 years 4 months ago
2000
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...