1933 search results - page 64 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
The field of stochastic optimization studies decision making under uncertainty, when only probabilistic information about the future is available. Finding approximate solutions to...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
TCS
2008
13 years 8 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
GECCO
2006
Springer
14 years 13 days ago
2006
Springer
Action set selection in Markov Decision Processes (MDPs) is an area of research that has received little attention. On the other hand, the set of actions available to an MDP agent...