{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:25:58Z","timestamp":1729635958530,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/comswa.2006.1665178","type":"proceedings-article","created":{"date-parts":[[2006,8,8]],"date-time":"2006-08-08T18:44:03Z","timestamp":1155062643000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Call Control on Lines"],"prefix":"10.1109","author":[{"family":"R. Sai Anand","sequence":"first","affiliation":[]},{"given":"T.","family":"Erlebach","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","first-page":"412","article-title":"Online admission control and circuit routing for high performance computing and communication","author":"awerbuch","year":"1994","journal-title":"FOCS 1994 Proceedings of the 35th Symposium on Foundations of Computer Science"},{"key":"2","first-page":"312","article-title":"Competitive non-preemptive call control","author":"awerbuch","year":"1994","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms SODA 1994"},{"key":"10","first-page":"333","article-title":"Ring routing and wavelength translation","author":"wilfong","year":"1998","journal-title":"Proc 1998 9th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_67"},{"key":"7","first-page":"129","article-title":"The complexity of wire routing and finding the minimum area layouts for arbitrary VLSI circuits","volume":"2","author":"kramer","year":"1984","journal-title":"Advances in Computing Research VLSI Theory"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0821"},{"key":"5","first-page":"410","article-title":"Multicommodity demand flow in a tree","volume":"2719","author":"chekuri","year":"2003","journal-title":"LNCS"},{"key":"4","first-page":"51","article-title":"Approximation algorithms for unsplittable flow problem","volume":"2462","author":"chakrabarti","year":"2002","journal-title":"LNCS"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202792"},{"key":"8","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"menger","year":"1927","journal-title":"Fundamenta Mathematicae"}],"event":{"name":"2006 1st International Conference on Communication Systems Software & Middleware","location":"New Delhi, India"},"container-title":["2006 1st International Conference on Communication Systems Software & Middleware"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/11046\/34859\/01665178.pdf?arnumber=1665178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T11:27:10Z","timestamp":1555759630000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1665178\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/comswa.2006.1665178","relation":{},"subject":[]}}