791 search results - page 27 / 159 » Approximating the Maximum Sharing Problem |
118
click to vote
FOCS
2008
IEEE
15 years 27 days ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
100
click to vote
CORR
2006
Springer
14 years 12 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
105
click to vote
IPL
2006
14 years 11 months ago
2006
Max-Satisfy is the problem of finding an assignment that satisfies the maximum number of equations in a system of linear equations over Q. We prove that unless NPBPP Max-Satisfy c...
101
click to vote
SIAMCOMP
2002
14 years 11 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
WAOA
2007
Springer
15 years 6 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...