7129 search results - page 278 / 1426 » Approximation Algorithms for Treewidth |
160
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
136
click to vote
SIAMJO
2011
14 years 11 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
134
click to vote
ICML
1995
IEEE
16 years 5 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
175
click to vote
PDCAT
2005
Springer
15 years 10 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
138
click to vote
WEA
2005
Springer
15 years 10 months ago
2005
Springer
The vertex cover problem is a classic NP-complete problem for which the best worst-case approximation ratio is roughly 2. In this paper, we use a collection of simple reductions, e...