Balanced problems on graphs with categorization of edges

DOI10.7151/DMGT.1182MaRDI QIDQ4458967zbMATH OpenOpenAlexFDO

Authors Š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

NP-completenessoptimization problemscategorization of edges

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1786153
• Minimum perfect bipartite matchings and spanning trees under categorization
• Constrained weighted matchings and edge coverings in graphs
• A weighted perfect matching with constraints on weights of its parts
• The color-balanced spanning tree problem.

Cited in

(6)

• scientific article; zbMATH DE number 1786153 (Why is no real title available?)
• The color-balanced spanning tree problem.
• The balanced traveling salesman problem
• Node-balancing by edge-increments
• Minimum perfect bipartite matchings and spanning trees under categorization
• The quadratic balanced optimization problem

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

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