Sciweavers

Share
COLOGNETWENTE
2010
8 years 3 months ago
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
Stefano Gualandi, Francesco Maffioli, Claudio Magn...
COLOGNETWENTE
2010
8 years 4 months ago
On the Convergence of Feasibility based Bounds Tightening
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Libert...
COLOGNETWENTE
2010
8 years 4 months ago
Interval Total Colorings of Bipartite Graphs
An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, ,t… G , 1, 2, ,i i t= … ,...
Petros A. Petrosyan, Ani Shashikyan, Arman Yu. Tor...
COLOGNETWENTE
2010
8 years 4 months ago
Bisimplicial Edges in Bipartite Graphs
Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to...
Matthijs Bomhoff, Bodo Manthey
COLOGNETWENTE
2010
8 years 4 months ago
Static Symmetry Breaking in Circle Packing
Alberto Costa, Pierre Hansen, Leo Liberti
COLOGNETWENTE
2010
8 years 4 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak
COLOGNETWENTE
2010
8 years 4 months ago
Approximating Independent Set in Semi-Random Graphs
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
Bodo Manthey, Kai Plociennik
books