455 search results - page 51 / 91 » Approximation Algorithms for Partial Covering Problems |
142
click to vote
SIAMCOMP
1998
15 years 1 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
APPROX
2004
Springer
15 years 6 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
115
click to vote
CIAC
2006
Springer
15 years 5 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
100
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
130
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
Decentralized Markov decision processes are frequently used to model cooperative multi-agent systems. In this paper, we identify a subclass of general DEC-MDPs that features regul...