{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:46:17Z","timestamp":1725543977271},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642114755"},{"type":"electronic","value":"9783642114762"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11476-2_6","type":"book-chapter","created":{"date-parts":[[2010,1,25]],"date-time":"2010-01-25T01:15:31Z","timestamp":1264382131000},"page":"57-71","source":"Crossref","is-referenced-by-count":0,"title":["Designing Hypergraph Layouts to GMPLS Routing Strategies"],"prefix":"10.1007","author":[{"given":"Jean-Claude","family":"Bermond","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Coudert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joanna","family":"Moulierac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"P\u00e9rennes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignasi","family":"Sau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Solano Donado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/978-3-642-01399-7_63","volume-title":"NETWORKING 2009","author":"J.-C. Bermond","year":"2009","unstructured":"Bermond, J.-C., Coudert, D., Moulierac, J., Perennes, S., Rivano, H., Sau, I., Solano Donado, F.: MPLS label stacking on the line network. In: Fratta, L., Schulzrinne, H., Takahashi, Y., Spaniol, O. (eds.) NETWORKING 2009. LNCS, vol.\u00a05550, pp. 809\u2013820. Springer, Heidelberg (2009)"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00394-2","volume":"291","author":"J.-C. Bermond","year":"2003","unstructured":"Bermond, J.-C., Marlin, N., Peleg, D., P\u00e9rennes, S.: Directed virtual path layouts in ATM networks. Theoretical Computer Science\u00a0291(1), 3\u201328 (2003)","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M. Bern","year":"1989","unstructured":"Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Processing Letters\u00a032, 171\u2013176 (1989)","journal-title":"Information Processing Letters"},{"issue":"1","key":"6_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1109\/MCOM.2005.1381881","volume":"43","author":"S. Bhatnagar","year":"2005","unstructured":"Bhatnagar, S., Ganguly, S., Nath, B.: Creating Multipoint-to-Point LSPs for traffic engineering. IEEE Commun. Mag.\u00a043(1), 95\u2013100 (2005)","journal-title":"IEEE Commun. Mag."},{"key":"6_CR5","unstructured":"Charikar, M., Chekuri, C., Cheung, T., Dai, Z., Goel, A., Guha, S., Li, M.: Approximation algorithms for directed Steiner problems. In: Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 192\u2013200 (1998)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(98)80002-4","volume":"83","author":"O. Gerstel","year":"1998","unstructured":"Gerstel, O., Wool, A., Zaks, S.: Optimal layouts on a chain ATM network. Discrete Applied Mathematics\u00a083, 157\u2013178 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR7","unstructured":"Goemans, M.X., Goldberg, A.V., Plotkin, S., Shmoys, D.B., Tardos, E., Williamson, D.P.: Improved approximation algorithms for network design problems. In: Proc. of the 5th annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 223\u2013232 (1994)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1145\/174652.174654","volume":"41","author":"S. Khuller","year":"1994","unstructured":"Khuller, S., Vishkin, U.: Biconnectivity approximations and graph carvings. Journal of the ACM\u00a041, 214\u2013235 (1994)","journal-title":"Journal of the ACM"},{"issue":"10","key":"6_CR9","first-page":"2993","volume":"23","author":"F. Ramos","year":"2005","unstructured":"Ramos, F., et al.: IST-LASAGNE: Towards all-optical label swapping employing optical logic gates and optical flip-flops. IEEE J. Sel. Areas Commun.\u00a023(10), 2993\u20133011 (2005)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proc. of the 29th annual ACM Symposium on Theory of Computing (STOC), pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Saito, H., Miyao, Y., Yoshida, M.: Traffic engineering using multiple MultiPoint-to-Point LSPs. In: Proc. of IEEE INFOCOM, pp. 894\u2013901 (2000)","DOI":"10.1109\/INFCOM.2000.832264"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Solano, F., Caenegem, R.V., Colle, D., Marzo, J.L., Pickavet, M., Fabregat, R., Demeester, P.: All-optical label stacking: Easing the trade-offs between routing and architecture cost in all-optical packet switching. In: Proc. of IEEE INFOCOM, pp. 655\u2013663 (2008)","DOI":"10.1109\/INFOCOM.2008.115"},{"issue":"7","key":"6_CR13","doi-asserted-by":"publisher","first-page":"1056","DOI":"10.1109\/TCOMM.2008.050601","volume":"56","author":"F. Solano","year":"2007","unstructured":"Solano, F., Fabregat, R., Marzo, J.: On optimal computation of MPLS label binding for MultiPoint-to-Point connections. IEEE Trans. Commun.\u00a056(7), 1056\u20131059 (2007)","journal-title":"IEEE Trans. Commun."},{"key":"6_CR14","unstructured":"Solano, F., Moulierac, J.: Routing in All-Optical Label Switched-based Networks with Small Label Spaces. In: Proc. of the 13th Conference on Optical Network Design and Modeling, ONDM (2009)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Solano, F., Stidsen, T., Fabregat, R., Marzo, J.: Label space reduction in MPLS networks: How much can one label do? IEEE\/ACM Trans. Netw. (2009)","DOI":"10.1109\/TNET.2007.912382"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11476-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T05:35:34Z","timestamp":1558762534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11476-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642114755","9783642114762"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11476-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}