Sciweavers

IPCO
1993
98views Optimization» more  IPCO 1993»
14 years 23 days ago
A spectral approach to bandwidth and separator problems in graphs
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
Christoph Helmberg, Bojan Mohar, Svatopluk Poljak,...
IPCO
1993
144views Optimization» more  IPCO 1993»
14 years 23 days ago
Routing in grid graphs by cutting planes
Martin Grötschel, Alexander Martin, Robert We...
IPCO
1993
138views Optimization» more  IPCO 1993»
14 years 23 days ago
An efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
Harold N. Gabow, Michel X. Goemans, David P. Willi...