Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | ACM Digital Library |
|---|---|
| Author | Kawarabayashi, Ken-Ichi Kobayashi, Yusuke |
| Copyright Year | 2016 |
| Description | Author Affiliation: National Institute of Informatics, Tokyo, Japan(University of tsukuba, Tsukuba, Japan (Kobayashi, Yusuke; Kawarabayashi, Ken-Ichi)) |
| Abstract | In the maximum edge-disjoint paths problem, we are given a graph and a collection of pairs of vertices, and the objective is to find the maximum number of pairs that can be routed by edge-disjoint paths. An $\textit{r}-approximation$ algorithm for this problem is a polynomial-time algorithm that finds at least $OPT/\textit{r}$ edge-disjoint paths, where OPT denotes the maximum possible number of pairs that can be routed in a given instance. For a long time, an $O(n^{½}-approximation$ algorithm has been best known for this problem even if a congestion of two is allowed, that is, each edge is allowed to be used in at most two of the paths. In this article, we give a randomized $\textit{O}(\textit{n}&frac;37$ ċ poly(log $\textit{n}))-approximation$ algorithm with congestion two. This is the first result that breaks the $O(n^{½})-approximation$ algorithm. In particular, we prove the following: (1) If we have a (randomized) polynomial-time algorithm for finding Ω(OPT&frac1p $/polylog(\textit{n}))$ edge-disjoint paths for some $\textit{p}$ > 1, then we can give a randomized $O(n^{½}-α)-approximation$ algorithm for the edge-disjoint paths problem by using Rao-Zhou’s algorithm for some α > 0. (2) Based on the Chekuri-Khanna-Shepherd well-linked decomposition, we show that there is a randomized algorithm for finding $Ω(OPT^{¼}$ /(log $n)^{&frac32;})$ edge-disjoint paths connecting given terminal pairs with congestion two. Our framework for this algorithm is more general in the following sense. Indeed, the above two ingredients also work for the maximum edge-disjoint paths problem (with congestion one) if there is a (randomized) polynomial-time algorithm for finding Ω(OPT&frac;1p) edge-disjoint paths connecting given terminal pairs for some $\textit{p}$ > 1. |
| Starting Page | 1 |
| Ending Page | 17 |
| Page Count | 17 |
| File Format | |
| ISSN | 15496325 |
| e-ISSN | 15496333 |
| DOI | 10.1145/2960410 |
| Volume Number | 13 |
| Issue Number | 1 |
| Journal | ACM Transactions on Algorithms (TALG) |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2016-09-21 |
| Publisher Place | New York |
| Access Restriction | One Nation One Subscription (ONOS) |
| Subject Keyword | Chekuri--Khanna--Shepherd well-linked decomposition Disjoint paths problem Rao--Zhou algorithm |
| Content Type | Text |
| Resource Type | Article |
| Subject | Mathematics |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| 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 |
|
Loading...
|