Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

This paper presents a detailed review of both theory and algorithms for the Cheeger cut based on the graph 1-Laplacian. In virtue of the cell structure of the feasible set, we propose a cell descend ...

This is a preview. Log in through your library . Abstract We consider the feasibility problem OPP (orthogonal packing problem) in higher-dimensional orthogonal packing: given a set of d-dimensional (d ...