{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:35:44Z","timestamp":1725478544227},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695134"},{"type":"electronic","value":"9783540695141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/11970125_19","type":"book-chapter","created":{"date-parts":[[2007,1,24]],"date-time":"2007-01-24T00:47:40Z","timestamp":1169599660000},"page":"240-252","source":"Crossref","is-referenced-by-count":8,"title":["Competitive Online Multicommodity Routing"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Harks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Heinz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","volume-title":"OSPF: Anatomy of an Internet Routing Protocol","author":"J.T. Moy","year":"1999","unstructured":"Moy, J.T.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, Reading (1999)"},{"key":"19_CR2","unstructured":"Cisco: OSPF Design Guide (2006), Documentation available at \n                  \n                    http:\/\/www.cisco.com\/en\/US\/tech\/tk365"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Yahaya, A., Suda, T.: iREX: Inter-domain QoS Automation using Economics. In: Proceedings of IEEE CCNC (2006)","DOI":"10.1109\/CCNC.2006.1592995"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Yahaya, A., Harks, T., Suda, T.: iREX: Efficient Inter-domain QoS Automation using Economics. In: Proceedings of IEEE Globecom (2006)","DOI":"10.1109\/CCNC.2006.1592995"},{"key":"19_CR5","first-page":"756","volume":"20","author":"B. Fortz","year":"2002","unstructured":"Fortz, B., Thorup, M.: Optimizing OSPF\/IS-IS weights in a changing world. IEEE JSAC\u00a020, 756\u2013767 (2002)","journal-title":"IEEE JSAC"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/B:COAP.0000039487.35027.02","volume":"29","author":"B. Fortz","year":"2004","unstructured":"Fortz, B., Thorup, M.: Increasing internet capacity using local search. Computational Optimization and Applications\u00a029, 13\u201348 (2004)","journal-title":"Computational Optimization and Applications"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of the ACM\u00a049, 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res.\u00a029, 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"Online Algorithms: The State of the Art","year":"1998","unstructured":"Fiat, A., Woeginger, G.J. (eds.): Dagstuhl Seminar 1996. LNCS, vol.\u00a01442. Springer, Heidelberg (1998)"},{"key":"19_CR10","first-page":"32","volume-title":"34th Annual Symposium on Foundations of Computer Science (FOCS)","author":"B. Awerbuch","year":"1993","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive on-line routing. In: 34th Annual Symposium on Foundations of Computer Science (FOCS), Palo Alto, pp. 32\u201340. IEEE, Los Alamitos (1993)"},{"key":"19_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics, 2nd edn., vol.\u00a02. Springer, Heidelberg (1993)","edition":"2"},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"91","DOI":"10.6028\/jres.073B.010","volume":"73","author":"S. Dafermos","year":"1969","unstructured":"Dafermos, S., Sparrow, F.: The traffic assignment problem for a general network. J. Res. Natl. Bur. Stand., Sect. B\u00a073, 91\u2013118 (1969)","journal-title":"J. Res. Natl. Bur. Stand., Sect. B"},{"key":"19_CR13","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"19_CR14","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11970125_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:23:50Z","timestamp":1619493830000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11970125_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695134","9783540695141"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11970125_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}