{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:36:37Z","timestamp":1743154597186,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642206610"},{"type":"electronic","value":"9783642206627"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20662-7_4","type":"book-chapter","created":{"date-parts":[[2011,4,20]],"date-time":"2011-04-20T06:05:25Z","timestamp":1303279525000},"page":"43-53","source":"Crossref","is-referenced-by-count":2,"title":["Path Trading: Fast Algorithms, Smoothed Analysis, and Hardness Results"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Berger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heiko","family":"R\u00f6glin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"van der Zwaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Akella, A., Maggs, B., Seshan, S., Shaikh, A., Sitaraman, R.: A measurement-based analysis of multihoming. In: SIGCOMM, pp. 353\u2013364 (2003)","DOI":"10.1145\/863955.863995"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-72792-7_5","volume-title":"Integer Programming and Combinatorial Optimization","author":"R. Beier","year":"2007","unstructured":"Beier, R., R\u00f6glin, H., V\u00f6cking, B.: The smoothed number of pareto optimal solutions in bicriteria integer optimization. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol.\u00a04513, pp. 53\u201367. Springer, Heidelberg (2007)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-39405-1_29","volume-title":"Group Communications and Charges. Technology and Business Models","author":"R. Dai","year":"2003","unstructured":"Dai, R., Stahl, D.O., Whinston, A.B.: The economics of smart routing and quality of service. In: Stiller, B., Carle, G., Karsten, M., Reichl, P. (eds.) NGC 2003 and ICQT 2003. LNCS, vol.\u00a02816, pp. 318\u2013331. Springer, Heidelberg (2003)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Goldenberg, D.K., Qiu, L., Xie, H., Yang, Y.R., Zhang, Y.: Optimizing cost and performance for multihoming. In: SIGCOMM, pp. 79\u201382 (2004)","DOI":"10.1145\/1030194.1015478"},{"key":"4_CR5","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1997","unstructured":"Knuth, D.: The Art of Computer Programming, 3rd edn. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1997)","edition":"3"},{"issue":"17","key":"4_CR6","doi-asserted-by":"publisher","first-page":"3335","DOI":"10.1016\/j.comcom.2006.12.010","volume":"30","author":"Y. Liu","year":"2007","unstructured":"Liu, Y., Reddy, A.L.N.: Multihoming route control among a group of multihomed stub networks. Computer Comm.\u00a030(17), 3335\u20133345 (2007)","journal-title":"Computer Comm."},{"key":"4_CR7","unstructured":"Mahajan, R., Wetherall, D., Anderson, T.: Negotiation-based routing between neighboring ISPs. In: NSDI, pp. 29\u201342 (2005)"},{"issue":"9","key":"4_CR8","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1287\/mnsc.15.9.494","volume":"15","author":"G.L. Nemhauser","year":"1969","unstructured":"Nemhauser, G.L., Ullmann, Z.: Discrete dynamic programming and capital allocation. Management Science\u00a015(9), 494\u2013505 (1969)","journal-title":"Management Science"},{"key":"4_CR9","unstructured":"Quoitin, B., Bonaventure, O.: A cooperative approach to interdomain traffic engineering. In: EuroNGI (2005)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"R\u00f6glin, H., Teng, S.-H.: Smoothed Analysis of Multiobjective Optimization. In: FOCS, pp. 681\u2013690 (2009)","DOI":"10.1109\/FOCS.2009.21"},{"key":"4_CR11","unstructured":"Sevcik, P., Bartlett, J.: Improving user experience with route control. Technical Report NetForecast Report 5062, NetForecast, Inc. (2002)"},{"issue":"5","key":"4_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/1096536.1096546","volume":"35","author":"Y. Shavitt","year":"2005","unstructured":"Shavitt, Y., Shir, E.: DIMES: let the Internet measure itself. ACM SIGCOMM Computer Communication Review\u00a035(5), 71\u201374 (2005)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Shavitt, Y., Singer, Y.: Limitations and Possibilities of Path Trading between Autonomous Systems. In: INFOCOM (2010)","DOI":"10.1109\/INFCOM.2010.5461922"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Shrimali, G., Akella, A., Mutapcic, A.: Cooperative interdomain traffic engineering using nash bargaining and decomposition. In: INFOCOM, pp. 330\u2013338 (2007)","DOI":"10.1109\/INFCOM.2007.46"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. Journal of the ACM\u00a051(3), 385\u2013463 (2004)","journal-title":"Journal of the ACM"},{"issue":"10","key":"4_CR16","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1562764.1562785","volume":"52","author":"D.A. Spielman","year":"2009","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed analysis: an attempt to explain the behavior of algorithms in practice. Communic. of the ACM\u00a052(10), 76\u201384 (2009)","journal-title":"Communic. of the ACM"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Teixeira, R., Shaikh, A., Griffin, T., Rexford, J.: Dynamics of hot-potato routing in IP networks. In: SIGMETRICS, pp. 307\u2013319 (2004)","DOI":"10.1145\/1012888.1005723"},{"key":"4_CR18","unstructured":"Winick, J., Jamin, S., Rexford, J.: Traffic engineering between neighboring domains. Technical report (2002)"},{"issue":"6","key":"4_CR19","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1109\/MNET.2005.1541717","volume":"19","author":"Y.R. Yang","year":"2005","unstructured":"Yang, Y.R., Xie, H., Wang, H., Silberschatz, A., Krishnamurthy, A., Liu, Y., Li, E.L.: On route selection for interdomain traffic engineering. IEEE Network\u00a019(6), 20\u201327 (2005)","journal-title":"IEEE Network"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20662-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:24:51Z","timestamp":1558571091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20662-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642206610","9783642206627"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20662-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}