16 search results - page 3 / 4 » Mixed-Integer Vertex Covers on Bipartite Graphs |
COMBINATORICS
2006
13 years 5 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
APPROX
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
FOCS
2009
IEEE
14 years 15 days ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
WG
2004
Springer
13 years 11 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...