369 search results - page 27 / 74 » Approximation Algorithms for the Bi-criteria Weighted max-cu... |
ENDM
2008
14 years 12 months ago
2008
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
118
click to vote
FOCS
2002
IEEE
15 years 4 months ago
2002
IEEE
We consider the classical vertex cover and set cover problems with the addition of hard capacity constraints. This means that a set (vertex) can only cover a limited number of its...
121
click to vote
COMBINATORICA
2010
14 years 6 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
105
click to vote
EACL
2009
ACL Anthology
16 years 11 days ago
2009
ACL Anthology
We present a unified view of many translation algorithms that synthesizes work on deductive parsing, semiring parsing, and efficient approximate search algorithms. This gives rise...
103
click to vote
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...