Efficient algorithms for minimum range cut problems

DOI10.1002/net.3230240705zbMath0823.90126OpenAlexW4239068102MaRDI QIDQ4313630

Kazuo Iwano, Naoki Katoh

Publication date: 27 November 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240705

zbMATH Keywords

minimum spanning treeundirected graphsancestor treeminimum range cut problemupper-critical cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (8)

A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems ⋮ Minimum dispersion problems ⋮ The balanced traveling salesman problem ⋮ A branch-and-cut algorithm for the balanced traveling salesman problem ⋮ Balanced Optimization with Vector Costs ⋮ Robust balanced optimization ⋮ Exact algorithms for the equitable traveling salesman problem ⋮ The quadratic balanced optimization problem

Cites Work

• An Õ(n²) algorithm for minimum cuts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for minimum range cut problems