Using the minimum maximum flow degree to approximate the flow coloring problem

Manoel Campêlo () and Jhonata A. S. Matias ()
Additional contact information
Manoel Campêlo: Universidade Federal do Ceará
Jhonata A. S. Matias: Universidade Federal do Ceará

Annals of Operations Research, 2022, vol. 316, issue 2, No 24, 1267-1278

Abstract: Abstract Consider an arc-capacitated network $$\mathcal {N}$$ N through which an integer-valued flow must be sent from several source nodes to a sink node. Each feasible flow defines a corresponding multigraph with the same vertices as $$\mathcal {N}$$ N and an edge for each arc of $$\mathcal {N}$$ N , where the edge multiplicity is the flow in the respective arc. The maximum flow degree of a feasible flow is the maximum sum of the flow entering and leaving a node of $$\mathcal {N}$$ N , i.e. the maximum degree of the corresponding multigraph. The minimum maximum flow degree problem (MMFDP) consists in determining on $$\mathcal {N}$$ N a feasible flow such that its maximum flow degree is minimum. We present a polynomial time algorithm for this problem. We use its optimum value to derive an improved upper bound for the flow coloring problem (FCP), which consists in finding a feasible flow whose corresponding multigraph has the minimum chromatic index. Based on this procedure, we design an approximation algorithm for the FCP that improves the best known approximation factor.

Keywords: Graph algorithms; Network flow; Flow degree; Flow coloring problem; Approximation algorithm (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-021-04180-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:316:y:2022:i:2:d:10.1007_s10479-021-04180-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-021-04180-3

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().