1933 search results - page 7 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
COR
2006
13 years 7 months ago
2006
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
SOFSEM
2009
Springer
14 years 4 months ago
2009
Springer
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...