73 search results - page 7 / 15 » ipco 2007 |
IPCO
1998
13 years 8 months ago
1998
We give a proof of Guenin's theorem characterizing weakly bipartite graphs by not having an odd-K5 minor. The proof curtails the technical and case-checking parts of Guenin�...
IPCO
2004
13 years 8 months ago
2004
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are: (i) an efficie...
IPCO
2004
13 years 8 months ago
2004
Let P be a random 0/1-polytope in d with n(d) vertices, and denote by k(P) the k-face density of P, i.e., the quotient of the number of k-dimensional faces of P and `n(d) k+1
IPCO
1996
13 years 8 months ago
1996
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
IPCO
1996
13 years 8 months ago
1996
This paper investigates a restricted version of the Quadratic Assignment Problem (QAP), where one of the coefficient matrices is an Anti-Monge matrix with non-decreasing rows and ...