3874 search results - page 160 / 775 » Approximation Algorithms for k-hurdle Problems |
112
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
135
Voted
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
94
Voted
RTSS
2002
IEEE
15 years 6 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
110
click to vote
FOCS
2004
IEEE
15 years 5 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
142
click to vote
AAAI
2000
15 years 3 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...