7930 search results - page 586 / 1586 » Greedy in Approximation Algorithms |
161
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
200
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
173
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
We present a (2 3 − o(1))-approximation algorithm for the partial latin square extension (PLSE) problem. This improves the current best bound of 1 − 1 e due to Gomes, Regis, an...
188
click to vote
CCIA
2005
Springer
16 years 21 days ago
2005
Springer
— This paper proposes a high-level Reinforcement Learning (RL) control system for solving the action selection problem of an autonomous robot. Although the dominant approach, whe...
180
click to vote
VISUALIZATION
1997
IEEE
15 years 11 months ago
1997
IEEE
We present an algorithm for the visualization of vector field topology based on Clifford algebra. It is the first method allowing the detection of higher order singularities. Th...