The Minimum Labelling Spanning k-Forest

Vol 56, 2024 - 310173
Extended Abstracts (EA)
Download
Favorite this paper
How to cite this paper?
Abstract

The Minimum Labelling Spanning k-Forest consists in, given an edge-colored graph, finding a spanning forest with at most k components and minimum number of colors. This paper presents the problem, introduces an integer linear programming formulation, and reports computational experiments.

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Programme
13:30 to 15:00 on 11/07/2024
Brasil 5
Institutions
  • 1 Universidade Federal do Ceará
Track
  • 15. PM – Mathematical Programming
Keywords
Graph Optimization
Edge Coloring
Spanning Forest