Balanced problems on graphs with categorization of edges

DOI10.7151/DMGT.1182zbMATH Open1050.05112OpenAlexW1984647604MaRDI QIDQ4458967FDOQ4458967

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

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.

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)

Cited In (6)

• The balanced connected subgraph problem
• Title not available (Why is that?)
• The balanced traveling salesman problem
• Minimum perfect bipartite matchings and spanning trees under categorization
• The quadratic balanced optimization problem
• Title not available (Why is that?)

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)