Efficient algorithms for minimum range cut problems

DOI10.1002/NET.3230240705zbMATH Open0823.90126OpenAlexW4239068102MaRDI QIDQ4313630FDOQ4313630

Authors: Naoki Katoh, Kazuo Iwano 

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

Recommendations

• scientific article; zbMATH DE number 177540
• scientific article; zbMATH DE number 742961
• Fundamentals of Computation Theory
• Minimum cuts in near-linear time
• A simple and fast min-cut algorithm

zbMATH Keywords

minimum spanning treeundirected graphsancestor treeminimum range cut problemupper-critical cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Õ(n²) algorithm for minimum cuts
• Title not available (Why is that?)

Cited In (12)

• Minimum dispersion problems
• Balanced Optimization with Vector Costs
• Exact algorithms for the equitable traveling salesman problem
• A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems
• Title not available (Why is that?)
• Implementing an efficient minimum capacity cut algorithm
• Massively Parallel Algorithms for Minimum Cut
• Efficient Algorithms for the Label Cut Problems
• The balanced traveling salesman problem
• Robust balanced optimization
• A branch-and-cut algorithm for the balanced traveling salesman problem
• The quadratic balanced optimization problem

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

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