NDLI: Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees

Please wait, while we are loading the content...

Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees

Content Provider	ACM Digital Library
Author	Erlebach, Thomas Jansen, Klaus
Copyright Year	2002
Abstract	Given a set of weighted directed paths in a bidirected tree, the maximum weight edge-disjoint paths problem (MWEDP) is to select a subset of the given paths such that the selected paths are edge-disjoint and the total weight of the selected paths is maximized. MWEDP is $\textit{NP}-$ hard for bidirected trees of unbounded degree, even if all weights are the same (the unweighted case). Three different approximation algorithms are implemented: a known combinatorial (5/3 + ε)-approximation algorithm $\textit{A}1$ for the unweighted case, a new combinatorial 2-approximation algorithm $\textit{A}2$ for the weighted case, and a known (5/3 + ε)-approximation algorithm $\textit{A}3$ for the weighted case that is based on linear programming. For algorithm $\textit{A}1,$ it is shown how efficient data structures can be used to obtain a worst-case running-time of O(m + n + $4^{1/ε}$ √n ċ m) for instances consisting of $\textit{m}$ paths in a tree with $\textit{n}$ nodes. Experimental results regarding the running-times and the quality of the solutions obtained by the three approximation algorithms are reported. Where possible, the approximate solutions are compared to the optimal solutions, which were computed by running CPLEX on an integer linear programming formulation of MWEDP.
Starting Page	6
File Format	PDF
ISSN	10846654
e-ISSN	10846654
DOI	10.1145/944618.944624
Journal	Journal of Experimental Algorithmics (JEA)
Volume Number	7
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2002-12-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Algorithms Combinatorial optimization Experimentation Linear programming
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees (2000).

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

Edge Disjoint Paths in Moderately Connected Graphs

Constrained shortest link-disjoint paths selection: a network programming based approach

Edge-Disjoint Paths in Planar Graphs with Constant Congestion

Fault-Tolerant Edge-Disjoint Paths -- Beyond Uniform Faults

Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle

On the complexity of vertex-disjoint length-restricted path problems

Integrality Ratio for Group Steiner Trees and Directed Steiner Trees

Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees

Similar Documents

Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees (2000).

The Maximum Edge-Disjoint Paths Problem in Bidirected Trees

Edge Disjoint Paths in Moderately Connected Graphs

Constrained shortest link-disjoint paths selection: a network programming based approach

Edge-Disjoint Paths in Planar Graphs with Constant Congestion

Fault-Tolerant Edge-Disjoint Paths -- Beyond Uniform Faults

Improved Approximation Algorithms for Weighted Hypergraph Embedding in a Cycle

On the complexity of vertex-disjoint length-restricted path problems

Integrality Ratio for Group Steiner Trees and Directed Steiner Trees

Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees