scientific article; zbMATH DE number 1034105

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199612)28:4<221::AID-NET6>3.0.CO;2-N" /><221::AID-NET6>3.0.CO;2-N 10.1002/(SICI)1097-0037(199612)28:4<221::AID-NET6>3.0.CO;2-NzbMath0873.90102MaRDI QIDQ4344458

Anu Pathria, Dorit S. Hochbaum

Publication date: 15 July 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bottleneck graph partition problempolynomiality result

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (4)

Unnamed Item ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ NP-hard and linear variants of hypergraph partitioning ⋮ The stochastic bottleneck linear programming problem

This page was built for publication: