{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:37:14Z","timestamp":1725565034266},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221142"},{"type":"electronic","value":"9783540246855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24685-5_100","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T21:18:16Z","timestamp":1283980696000},"page":"602-606","source":"Crossref","is-referenced-by-count":0,"title":["On Balancing Delay and Cost for Routing Paths"],"prefix":"10.1007","author":[{"given":"Moonseong","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Cheol","family":"Bang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"100_CR1","volume-title":"Data Networks","author":"D. Bertsekas","year":"1992","unstructured":"Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice-Hall, Englewood Cliffs (1992)","edition":"2"},{"key":"100_CR2","volume-title":"Computers and intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"100_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/90.842145","volume":"8","author":"D.S. Reeves","year":"2000","unstructured":"Reeves, D.S., Salama, H.F.: A distributed algorithm for delay-constrained unicast routing. IEEE\/ACM Transac.\u00a08, 239\u2013250 (2000)","journal-title":"IEEE\/ACM Transac."},{"key":"100_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/3-540-44862-4_95","volume-title":"Computational Science \u2013 ICCS 2003","author":"A.S. Rodionov","year":"2003","unstructured":"Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Trees. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol.\u00a02658, pp. 879\u2013887. Springer, Heidelberg (2003)"},{"key":"100_CR5","unstructured":"Widyono, R.: The Design and Evaluation of Routing Algorithms for Real-Time Channels. International Computer Science Institute, Univ. of California at Berkeley, Tech. Rep. ICSI TR-94-024 (June 1994)"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24685-5_100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T05:16:02Z","timestamp":1553058962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24685-5_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221142","9783540246855"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24685-5_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}