31 search results - page 1 / 7 » Two fixed-parameter algorithms for Vertex Covering by Paths ... |
IPL
2008
13 years 4 months ago
2008
BIRTHDAY
2009
Springer
13 years 11 months ago
2009
Springer
Consider a tree T and a forest F. The paper discusses the following new problems: The Forest vertex-cover problem (FVC): cover the vertices of T by a minimum number of copies of tr...
TCBB
2010
12 years 11 months ago
2010
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
The group Steiner problem is a classical network design problem where we are given a graph and a collection of groups of vertices, and want to build a min-cost subgraph that conne...
CORR
2006
Springer
13 years 4 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...