3874 search results - page 143 / 775 » Approximation Algorithms for k-hurdle Problems |
163
click to vote
COCOON
2005
Springer
15 years 12 months ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
144
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
We study the approximability of 1-in-kSAT, the variant of Max kSAT where a clause is deemed satisfied when precisely one of its literals is satisfied. We also investigate differ...
183
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper presents a novel alternative approach, namely weakly supervised learning (WSL), to learn the pre-image of a feature vector in the feature space induced by a kernel. It ...
185
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
204
click to vote
STACS
2005
Springer
15 years 11 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...