Cut Tree Algorithms: An Experimental Study

DOI10.1006/jagm.2000.1136zbMath0969.68178OpenAlexW2028643523MaRDI QIDQ2709792

Kostas Tsioutsiouliklis, Andrew V. Goldberg

Publication date: 17 April 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1136

zbMATH Keywords

cut tree problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

A revisited branch-and-cut algorithm for large-scale orienteering problems ⋮ On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms ⋮ Parametric analysis on cut-trees and its application on a protein clustering problem ⋮ Unnamed Item

This page was built for publication: Cut Tree Algorithms: An Experimental Study