On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms

Deng, Yunyun; Guo, Longkun; Liao, Kewen; Chen, Yi

doi:10.1016/j.tcs.2021.08.009

Theoretical Computer Science

2021

DOI: 10.1016/j.tcs.2021.08.009

|View full text |Cite

On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms

Yunyun Deng

Longkun Guo

Kewen Liao

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It differs from the 𝑘-splittable Flow Problem [20,21] by forbidding two flows to pass through the same arc. It also relates to the Shortest Pair of Disjoint Paths [22] and other disjoint-path problems [23][24][25].…”

mentioning

confidence: 99%

The widestk-set of disjoint paths problem

2023

View full text Add to dashboard Cite

Finding disjoint and widest paths are key problems in telecommunication networks. In this paper, we study the Widest k-set of Disjoint Paths Problem (WKDPP), an NP-Hard optimization problem that considers both aspects. Given a digraph G=(N,A), WKDPP consists of computing k arc-disjoint paths between two nodes such that the sum of its minimum capacity arcs is maximized. We present three mathematical formulations for WKDPP, a symmetry-breaking inequality set, and propose two heuristic algorithms. Computational experiments compares the proposed heuristics with other from the literature show the effectiveness of the proposed methods.

show abstract

mentioning

confidence: 99%

The widestk-set of disjoint paths problem

2023

View full text Add to dashboard Cite

show abstract

Disjoint Paths Construction and Fault-Tolerant Routing in BCube of Data Center Networks

Fan

Xiao

Cai

et al. 2023

IEEE Trans. Comput.

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

On finding maximum disjoint paths with different colors: Computational complexity and practical LP-based algorithms

Cited by 2 publications

References 11 publications

The widestk-set of disjoint paths problem

The widestk-set of disjoint paths problem

Disjoint Paths Construction and Fault-Tolerant Routing in BCube of Data Center Networks

Contact Info

Product

Resources

About