{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:39:17Z","timestamp":1758267557171,"version":"3.28.0"},"reference-count":53,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.23919\/ifipnetworking.2018.8696560","type":"proceedings-article","created":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T22:37:40Z","timestamp":1556231860000},"page":"1-9","source":"Crossref","is-referenced-by-count":2,"title":["Waypoint Routing in Special Networks"],"prefix":"10.23919","author":[{"given":"Saeed Akhoondian","family":"Amiri","sequence":"first","affiliation":[]},{"given":"Klaus-Tycho","family":"Foerster","sequence":"additional","affiliation":[]},{"given":"Riko","family":"Jacob","sequence":"additional","affiliation":[]},{"given":"Mahmoud","family":"Parham","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289496"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-009-2407-4"},{"key":"ref33","first-page":"1","article-title":"A tourist guide through treewidth","volume":"11","author":"bodlaender","year":"1993","journal-title":"Acta Cybern"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72951-8_3"},{"key":"ref31","article-title":"Walking Through Waypoints","author":"akhoondian amiri","year":"0","journal-title":"LATIN"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700366103"},{"key":"ref37","first-page":"185","article-title":"Exact algorithms for np-hard problems: A survey","volume":"2570","author":"woeginger","year":"2001","journal-title":"Combinatorial Optimization"},{"key":"ref36","article-title":"An approximation algorithm for treewidth","author":"bodlaender","year":"2013","journal-title":"Proc FOCS"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s004539910002"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2014.07.002"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(91)90002-2"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300004284"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2896377.2901476"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1145\/2377677.2377680","article-title":"Making middleboxes someone else’s problem: Network processing as a cloud service","author":"sherry","year":"2012","journal-title":"Proc ACM Sigcomm"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1969-149-3"},{"key":"ref21","first-page":"433","article-title":"Planar permutation graphs","volume":"3","author":"chartrand","year":"1967","journal-title":"Annales de l'I H P - Probabilites & Statistiques"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1995.1006"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2011.07.004"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-43948-7_18"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25258-2_8"},{"key":"ref51","article-title":"An approximation algorithm for path computation and function placement in SDNs","author":"even","year":"2016","journal-title":"SIROCCO"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-74875-7_2"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993854"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2015.7417124"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218434"},{"key":"ref40","first-page":"19","article-title":"Edge-disjoint paths in planar graphs with short total length","author":"brandes","year":"1996"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7417124"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7417124"},{"key":"ref14","article-title":"Charting the Complexity Landscape of Waypoint Routing","volume":"48","author":"akhoondian amiri","year":"2018","journal-title":"SIGCOMM Comput Commun Rev"},{"key":"ref15","first-page":"88","article-title":"Matching: a well-solved class of linear programs","author":"edmonds","year":"1970","journal-title":"Combinatorial Structures and their Applications Proceedings of the Calgary Symposium"},{"key":"ref16","article-title":"Reseaux atm: conception et optimisation","author":"chanas","year":"1998","journal-title":"Ph D Dissertation"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.04.024"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402967"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633039"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2620728.2620754"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6134263"},{"journal-title":"Group TPM Specification","article-title":"Network functions virtualisation (nfv); acceleration technologies; vswitch benchmarking and acceleration specification","year":"2016","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/EWSDN.2014.18"},{"key":"ref8","article-title":"Towards unified programmability of cloud and carrier infrastructure","author":"p s","year":"2014","journal-title":"Proceeding of EWSDN"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2674005.2674989"},{"key":"ref49","article-title":"Online path computation and function placement in sdns","author":"even","year":"2016","journal-title":"Proc SSST"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787495"},{"key":"ref46","article-title":"Service Function Chaining Use Cases in Mobile Networks","author":"napper","year":"2016","journal-title":"Internet-draft"},{"journal-title":"White Paper","article-title":"Network functions virtualisation – introductory white paper","year":"2013","key":"ref45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90128-I"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054100000247"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00223-2"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-19488-6_110"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref44"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796"}],"event":{"name":"2018 IFIP Networking Conference (IFIP Networking) and Workshops","start":{"date-parts":[[2018,5,14]]},"location":"Zurich, Switzerland","end":{"date-parts":[[2018,5,16]]}},"container-title":["2018 IFIP Networking Conference (IFIP Networking) and Workshops"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8686043\/8696378\/08696560.pdf?arnumber=8696560","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T19:00:21Z","timestamp":1557774021000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8696560\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":53,"URL":"https:\/\/doi.org\/10.23919\/ifipnetworking.2018.8696560","relation":{},"subject":[],"published":{"date-parts":[[2018,5]]}}}