1389 search results - page 95 / 278 » Improved Approximation Algorithms for Label Cover Problems |
133
click to vote
CDC
2009
IEEE
15 years 7 months ago
2009
IEEE
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
111
click to vote
SWAT
1998
Springer
15 years 7 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
138
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
127
click to vote
MP
2010
15 years 1 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
120
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...