scientific article; zbMATH DE number 1034105

DOI10.1002/(SICI)1097-0037(199612)28:4%3C221::AID-NET6%3E3.0.CO;2-NMaRDI QIDQ4344458zbMATH OpenFDO

Authors Dorit S. Hochbaum, Anu Pathria

Publication date 15 July 1997

Full work available at URL https://doi.org/10.1002/(SICI)1097-0037(199612)28:4%3C221::AID-NET6%3E3.0.CO;2-N

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)

Recommendations

• scientific article; zbMATH DE number 1310280
• A linear time algorithm for graph partition problems
• scientific article; zbMATH DE number 3891429

Cited in

(9)

• NP-hard and linear variants of hypergraph partitioning
• On a bottleneck bipartition conjecture of Erdős
• The stochastic bottleneck linear programming problem
• scientific article; zbMATH DE number 3891429 (Why is no real title available?)
• scientific article; zbMATH DE number 1310280 (Why is no real title available?)
• Generalized Bottleneck Problems^∗
• Faster Pseudopolynomial Time Algorithms for Subset Sum
• On two simple[st] learning tasks
• Simple probabilistic analysis to generalize bottleneck graph multi-partitioning

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344458)