31 search results - page 1 / 7 » Two fixed-parameter algorithms for Vertex Covering by Paths ... |
50
Voted
IPL
2008
15 years 21 days ago
2008
85
Voted
BIRTHDAY
2009
Springer
15 years 7 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...
124
click to vote
TCBB
2010
14 years 7 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...
100
Voted
SODA
2010
ACM
15 years 10 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...
116
Voted
CORR
2006
Springer
15 years 22 days 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...