Balanced problems on graphs with categorization of edges

DOI10.7151/dmgt.1182zbMath1050.05112OpenAlexW1984647604MaRDI QIDQ4458967

Štefan Berežný, Vladimír Lacko

Publication date: 25 March 2004

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1182

zbMATH Keywords

optimization problemsNP-completenesscategorization of edges

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

The balanced traveling salesman problem ⋮ Unnamed Item ⋮ The quadratic balanced optimization problem

This page was built for publication: Balanced problems on graphs with categorization of edges