Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2401.10729 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910302888525824 |
|---|---|
| author | Bansal, Ishan Mao, Ryan Mishra, Avhan |
| author_facet | Bansal, Ishan Mao, Ryan Mishra, Avhan |
| contents | We study the single pair capacitated network design problem and the budget constrained max flow problem on undirected series-parallel graphs. These problems were well studied on directed series-parallel graphs, but little is known in the context of undirected graphs. The major difference between the cases is that the source and sink of the problem instance do not necessarily coincide with the terminals of the underlying series-parallel graph in the undirected case, thus creating certain complications. We provide pseudopolynomial time algorithms to solve both of the problems and provide an FPTAS for the budget constrained max flow problem. We also provide some extensions, arguing important cases when the problems are polynomial-time solvable, and describing a series-parallel gadget that captures an edge upgrade version of the problems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_10729 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Network Design on Undirected Series-Parallel Graphs Bansal, Ishan Mao, Ryan Mishra, Avhan Data Structures and Algorithms We study the single pair capacitated network design problem and the budget constrained max flow problem on undirected series-parallel graphs. These problems were well studied on directed series-parallel graphs, but little is known in the context of undirected graphs. The major difference between the cases is that the source and sink of the problem instance do not necessarily coincide with the terminals of the underlying series-parallel graph in the undirected case, thus creating certain complications. We provide pseudopolynomial time algorithms to solve both of the problems and provide an FPTAS for the budget constrained max flow problem. We also provide some extensions, arguing important cases when the problems are polynomial-time solvable, and describing a series-parallel gadget that captures an edge upgrade version of the problems. |
| title | Network Design on Undirected Series-Parallel Graphs |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2401.10729 |