Multicriteria global minimum cuts

DOI10.1007/s00453-006-0068-xzbMath1100.90043OpenAlexW2006742819WikidataQ60299149 ScholiaQ60299149MaRDI QIDQ2509022

Uri Zwick, Amitai Armon

Publication date: 16 October 2006

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-0068-x

zbMATH Keywords

undirected graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (15)

Complexity of min-max-min robustness for combinatorial optimization under discrete uncertainty ⋮ Unbalanced graph partitioning ⋮ A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem ⋮ Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs ⋮ Obtaining approximately optimal and diverse solutions via dispersion ⋮ On the minimum \(s-t\) cut problem with budget constraints ⋮ Multicriteria cuts and size-constrained \(k\)-cuts in hypergraphs ⋮ Complexity of the min-max (regret) versions of min cut problems ⋮ Robust combinatorial optimization under convex and discrete cost uncertainty ⋮ Multicriteria Cuts and Size-Constrained k-Cuts in Hypergraphs. ⋮ Blocking optimal structures ⋮ Connectivity interdiction ⋮ Unbalanced graph cuts with minimum capacity ⋮ Unnamed Item ⋮ Cardinality constrained and multicriteria (multi)cut problems

This page was built for publication: Multicriteria global minimum cuts