Sciweavers

COLOGNETWENTE
2009
14 years 16 days ago
Acyclic and Frugal Colourings of Graphs
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
Ross J. Kang, Tobias Müller
COLOGNETWENTE
2009
14 years 16 days ago
Integer Programming with 2-Variable Equations and 1-Variable Inequalities
We present an efficient algorithm to find an optimal integer solution of a given system of 2-variable equalities and 1-variable inequalities with respect to a given linear objectiv...
Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
COLOGNETWENTE
2009
14 years 16 days ago
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
J. Correa, Nicole Megow, R. Raman, Karol Suchan
COLOGNETWENTE
2009
14 years 16 days ago
Combinatorial Optimization Based Recommender Systems
Fabio Roda, Leo Liberti, Franco Raimondi
COLOGNETWENTE
2008
14 years 16 days ago
A Note on LP Relaxations for the 1D Cutting Stock Problem with Setup Costs
Alessandro Aloisio, Claudio Arbib, Fabrizio Marine...