{"type":"ScholarlyArticle","title":"A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths","authors":[{"name":"Longkun Guo","slug":"longkun-guo","given":"Longkun","family":"Guo","affiliation":"College of Mathematics and Computer Science , Fuzhou University , Fuzhou 350116 , Fujian , China"},{"name":"Yunyun Deng","slug":"yunyun-deng","given":"Yunyun","family":"Deng","affiliation":"College of Mathematics and Computer Science , Fuzhou University , Fuzhou 350116 , Fujian , China"},{"name":"Kewen Liao","slug":"kewen-liao","given":"Kewen","family":"Liao","affiliation":"Department of Computer Science and Software Engineering , Swinburne University , VIC , Australia"},{"name":"Qiang He","slug":"qiang-he","given":"Qiang","family":"He","affiliation":"Department of Computer Science and Software Engineering , Swinburne University , VIC , Australia"},{"name":"Timos Sellis","slug":"timos-sellis","given":"Timos","family":"Sellis","affiliation":"Department of Computer Science and Software Engineering , Swinburne University , VIC , Australia"},{"name":"Zheshan Hu","slug":"zheshan-hu","given":"Zheshan","family":"Hu","affiliation":"College of Mathematics and Computer Science , Fuzhou University , Fuzhou 350116 , Fujian , China"}],"abstract":"The classical disjoint shortest path problem has recently recalled\r\ninterests from researchers in the network planning and optimization\r\ncommunity. However, the requirement of the shortest paths being completely\r\nvertex or edge disjoint might be too restrictive and demands much\r\nmore resources in a network. Partially disjoint shortest paths, in\r\nwhich a bounded number of shared vertices or edges is allowed, balance\r\nbetween degree of disjointness and occupied network resources.\r\n\r\nIn this paper, we consider the problem of finding k \r\nshortest paths which are edge disjoint but partially vertex disjoint.\r\nFor a pair of distinct vertices in a network graph, the problem aims\r\nto optimally find k edge disjoint shortest paths among which\r\nat most a bounded number of vertices are shared by at least two paths. In particular,\r\nwe present novel techniques for exactly solving the problem\r\nwith a runtime  that  significantly improves\r\nthe current best result. The\r\nproposed algorithm is also validated by computer experiments on both\r\nsynthetic and real networks which demonstrate its superior efficiency\r\nof up to three orders of magnitude faster than the state of the art.","doi":"10.24963/ijcai.2018/202","url":"https://ijcai.org/proceedings/2018/202","pdf":"https://ijcai.org/proceedings/2018/0202.pdf","markdown":"https://ijcai.org/proceedings/2018/202.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/202","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Heuristic Search and Game Playing","track":"Main track","number":202,"pages":{"first":1456,"last":1462},"keywords":["Heuristic Search and Game Playing: Combinatorial Search and Optimisation","Multidisciplinary Topics and Applications: AI and the Web","Multidisciplinary Topics and Applications: Databases"],"videos":[],"references":[{"position":1,"raw":"Email-Enron 36,692 183,831 20.76 Email-EuAll 265,214 420,045 35.04 p2p-Gnut.05 8,846 31,839 2.55 p2p-Gnut.06 8,717 31,525 2.94 p2p-Gnut.08 6,301 20,777 1.92 Networks #Nodes #Edges EA (s) p2p-Gnut.09 8,114 26,013 2.40 p2p-Gnut.24 26,518 65,369 6.02 p2p-Gnut.25 22,687 54,705 5.13 p2p-Gnut.30 36,682 88,328 8.44 p2p-Gnut.31 62,586 147,892 13.40","title":"Email-Enron","authors":null,"year":null,"venue":"Email-Enron","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ahuja et al., 1993] Ravindra K Ahuja, Thomas L Magnanti, and James B Orlin. Network flows: theory, algorithms, and applications. 1993.","title":"Network flows: theory, algorithms, and applications","authors":"Thomas L Ravindra K Ahuja, James B Magnanti, Orlin","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Akiba et al., 2015] Takuya Akiba, Takanori Hayashi, No- zomi Nori, Yoichi Iwata, and Yuichi Yoshida. Efficient top-k shortest-path distance queries on large networks by pruned landmark labeling. In AAAI, volume 15, pages 25- 30, 2015.","title":"Efficient top-k shortest-path distance queries on large networks by pruned landmark labeling","authors":"Takuya Akiba, Takanori Hayashi, Nozomi Nori, Yoichi Iwata, Yuichi Yoshida","year":"2015","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Andrews et al., 2005] Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, and Lisa Zhang. Hardness of the undi- rected edge-disjoint paths problem with congestion. In Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on, pages 226-241. IEEE, 2005.","title":"Hardness of the undirected edge-disjoint paths problem with congestion","authors":"Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang","year":"2005","venue":"FOCS 2005. 46th Annual IEEE Symposium on","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Andrews, 2010] Matthew Andrews. Approximation algo- rithms for the edge-disjoint paths problem via raecke decompositions. In Foundations of Computer Science (FOCS), 2010 51st Annual IEEE Symposium on, pages 277-286. IEEE, 2010.","title":"Approximation algorithms for the edge-disjoint paths problem via raecke decompositions","authors":"Matthew Andrews","year":"2010","venue":"Foundations of Computer Science (FOCS)","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chekuri and Ene, 2013] Chandra Chekuri and Alina Ene. Poly-logarithmic approximation for maximum node dis- joint paths with constant congestion. In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pages 326-341. Society for Industrial and Ap- plied Mathematics, 2013.","title":"Poly-logarithmic approximation for maximum node disjoint paths with constant congestion","authors":"Ene Chekuri, Chandra Chekuri, Alina Ene","year":"2013","venue":"Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Chekuri et al., 2005] Chandra Chekuri, Sanjeev Khanna, and F Bruce Shepherd. Multicommodity flow, well-linked terminals, and routing problems. In Proceedings of the thirty-seventh annual ACM symposium on Theory of com- puting, pages 183-192. ACM, 2005.","title":"Multicommodity flow, well-linked terminals, and routing problems","authors":"Chandra Chekuri, Sanjeev Khanna, F Bruce Shepherd","year":"2005","venue":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chuzhoy, 2016] Julia Chuzhoy. Routing in undirected graphs with constant congestion. SIAM Journal on Com- puting, 45(4):1490-1532, 2016.","title":"Routing in undirected graphs with constant congestion","authors":"Julia Chuzhoy","year":"2016","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Cormen, 2009] Thomas H Cormen. Introduction to algo- rithms. MIT press, 2009.","title":"Introduction to algorithms","authors":"Thomas H Cormen","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Garey and Johnson, 2002] Michael R Garey and David S Johnson. Computers and intractability, volume 29. wh freeman New York, 2002.","title":"Computers and intractability","authors":"R Michael, David S Garey, Johnson","year":"2002","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Guo et al., 2015] Longkun Guo, Kewen Liao, Hong Shen, and Peng Li. Brief announcement: Efficient approxima- tion algorithms for computing k disjoint restricted short- est paths. In Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, pages 62-64. ACM, 2015.","title":"Brief announcement: Efficient approximation algorithms for computing k disjoint restricted shortest paths","authors":"Guo","year":"2015","venue":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hansen and Abdoulahi, 2016] Eric A Hansen and Ibrahim Abdoulahi. General error bounds in heuristic search al- gorithms for stochastic shortest path problems. In AAAI, pages 3130-3137, 2016.","title":"General error bounds in heuristic search algorithms for stochastic shortest path problems","authors":"Eric A Hansen, Ibrahim Abdoulahi","year":"2016","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Hassin, 1992] Refael Hassin. Approximation schemes for the restricted shortest path problem. Mathematics of Op- erations research, 17(1):36-42, 1992.","title":"Approximation schemes for the restricted shortest path problem","authors":"Refael Hassin, Hassin","year":"1992","venue":"Mathematics of Operations research","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Imamichi et al., 2016] Takashi Imamichi, Takayuki Os- ogami, and Rudy Raymond. Truncating shortest path search for efficient map-matching. In IJCAI, pages 589- 595, 2016.","title":"Truncating shortest path search for efficient map-matching","authors":"Takashi Imamichi, Takayuki Osogami, Rudy Raymond","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/90"},{"position":15,"raw":"[Joksch, 1966] Hans C Joksch. The shortest route problem with constraints. Journal of Mathematical analysis and applications, 14(2):191-197, 1966.","title":"The shortest route problem with constraints","authors":"C Hans, Joksch","year":"1966","venue":"Journal of Mathematical analysis and applications","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kurose and Ross, 2009] James F Kurose and Keith W Ross. Computer networking: a top-down approach, volume 4. Addison Wesley Boston, USA, 2009.","title":"Computer networking: a top-down approach","authors":"F James, Keith W Kurose, Ross","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Lorenz and Raz, 2001] Dean H Lorenz and Danny Raz. A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters, 28(5):213-219, 2001.","title":"A simple efficient approximation scheme for the restricted shortest path problem","authors":"H Dean, Danny Lorenz, Raz","year":"2001","venue":"Operations Research Letters","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Orda and Sprintson, 2004] Ariel Orda and Alexander Sprintson. Efficient algorithms for computing disjoint qos paths. In INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, volume 1. IEEE, 2004.","title":"Ariel Orda and Alexander Sprintson. Efficient algorithms for computing disjoint qos paths","authors":"Sprintson Orda","year":"2004","venue":"Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Raghavan and Tompson, 1987] Prabhakar Raghavan and Clark D Tompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combi- natorica, 7(4):365-374, 1987.","title":"Randomized rounding: a technique for provably good algorithms and algorithmic proofs","authors":"Prabhakar Raghavan, Clark D Tompson","year":"1987","venue":"Combinatorica","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Seymour and Kar, 2013] Zachary Seymour and Dulal Kar. Finding partially link-disjoint paths in wireless sensor net- works. In Wireless Conference (EW), Proceedings of the 2013 19th European, pages 1-6. VDE, 2013.","title":"Finding partially link-disjoint paths in wireless sensor networks","authors":"Kar ; ] Zachary Seymour, Dulal Seymour, Kar","year":"2013","venue":"Wireless Conference (EW), Proceedings of the 2013 19th European","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Suurballe and Tarjan, 1984] JW Suurballe and RE Tarjan. A quick method for finding shortest pairs of disjoint paths. Networks, 14(2):325-336, 1984.","title":"A quick method for finding shortest pairs of disjoint paths","authors":"Tarjan ; Jw Suurballe, Suurballe, Tarjan","year":"1984","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Suurballe, 1974] JW Suurballe. Disjoint paths in a network. Networks, 4(2):125-145, 1974.","title":"JW Suurballe. Disjoint paths in a network","authors":"Suurballe","year":"1974","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Yallouz et al., 2016] Jose Yallouz, Ori Rottenstreich, Peter Babarczi, Avi Mendelson, and Ariel Orda. Optimal link- disjoint node-\"somewhat disjoint\" paths. In Network Pro- tocols (ICNP), 2016 IEEE 24th International Conference on, pages 1-10. IEEE, 2016.","title":"Optimal linkdisjoint node-\"somewhat disjoint\" paths","authors":"Yallouz","year":"2016","venue":"Network Protocols (ICNP), 2016 IEEE 24th International Conference on","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}