{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:40:37Z","timestamp":1725586837772},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208065"},{"type":"electronic","value":"9783642208072"}],"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-20807-2_29","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T13:58:49Z","timestamp":1308405529000},"page":"362-375","source":"Crossref","is-referenced-by-count":7,"title":["Universal Packet Routing with Arbitrary Bandwidths and Transit Times"],"prefix":"10.1007","author":[{"given":"Britta","family":"Peis","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Wiese","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s00453-002-1019-9","volume":"36","author":"M. Adler","year":"2003","unstructured":"Adler, M., Khanna, S., Rajaraman, R., Ros\u00e9n, A.: Time-constrained scheduling of weighted packets on trees and meshes. Algorithmica\u00a036, 123\u2013152 (2003)","journal-title":"Algorithmica"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Adler, M., Sitaraman, R., Rosenberg, A., Unger, W.: Scheduling time-constrained communication in linear networks. In: Proceedings of the 10th annual ACM symposium on Parallel Algorithms and Architectures (SPAA 1998), pp. 269\u2013278 (1998)","DOI":"10.1145\/277651.277693"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s00453-005-1189-3","volume":"45","author":"C. Busch","year":"2006","unstructured":"Busch, C., Magdon-Ismail, M., Mavronicolas, M., Spirakis, P.: Direct routing: Algorithms and complexity. Algorithmica\u00a045, 45\u201368 (2006)","journal-title":"Algorithmica"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(97)00198-9","volume":"196","author":"M. di Ianni","year":"1998","unstructured":"di Ianni, M.: Efficient delay routing. Theoretical Computer Science\u00a0196, 131\u2013151 (1998)","journal-title":"Theoretical Computer Science"},{"key":"29_CR5","unstructured":"Fleischer, L., Skutella, M.: Minimum cost flows over time without intermediate storage. In: Proceedings of the 14th Annual Symposium on Discrete Algorithms, SODA 2003 (2003)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/S0097539703427215","volume":"36","author":"L. Fleischer","year":"2007","unstructured":"Fleischer, L., Skutella, M.: Quickest flows over time. SIAM Journal on Computing\u00a036, 1600\u20131630 (2007)","journal-title":"SIAM Journal on Computing"},{"key":"29_CR7","first-page":"397","volume":"2719","author":"A. Hall","year":"2003","unstructured":"Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: Efficient algorithms and complexity. Theoretical Computer Science\u00a02719, 397\u2013409 (2003)","journal-title":"Theoretical Computer Science"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00453-006-0196-3","volume":"47","author":"A. Hall","year":"2007","unstructured":"Hall, A., Langkau, K., Skutella, M.: An FPTAS for quickest multicommodity flows with inflow-dependent transit times. Algorithmica\u00a047, 299\u2013321 (2007)","journal-title":"Algorithmica"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jagm.1998.0980","volume":"31","author":"F. Meyer Auf Der Heide","year":"1999","unstructured":"Meyer Auf Der Heide, F., Vocking, B.: Shortest paths routing in arbitrary networks. Journal of Algorithms\u00a031, 105\u2013131 (1999)","journal-title":"Journal of Algorithms"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.25.1.36.15211","volume":"25","author":"B. Hoppe","year":"2000","unstructured":"Hoppe, B., Tardos, \u00c9.: The quickest transshipment problem. Mathematics of Operations Research\u00a025, 36\u201362 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-03685-9_17","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"R. Koch","year":"2009","unstructured":"Koch, R., Peis, B., Skutella, M., Wiese, A.: Real-Time Message Routing and Scheduling. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol.\u00a05687, pp. 217\u2013230. Springer, Heidelberg (2009)"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"F.T. Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-scheduling in O(congestion\u2009+\u2009dilation) steps. Combinatorica\u00a014, 167\u2013186 (1994)","journal-title":"Combinatorica"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s004930050061","volume":"19","author":"F.T. Leighton","year":"1999","unstructured":"Leighton, F.T., Maggs, B.M., Richa, A.W.: Fast algorithms for finding O(congestion\u2009+\u2009dilation) packet routing schedules. Combinatorica\u00a019, 375\u2013401 (1999)","journal-title":"Combinatorica"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Leighton, F.T., Makedon, F., Tollis, I.G.: A 2n\u2009\u2212\u20092 step algorithm for routing in an n \u00d7n array with constant size queues. In: Proceedings of the 1st Annual Symposium on Parallel Algorithms and Architectures (SPAA 1989), pp. 328\u2013335 (1989)","DOI":"10.1145\/72935.72970"},{"key":"29_CR15","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling: Algorithms, Models and Performance Analysis","author":"J.Y.-T. Leung","year":"2004","unstructured":"Leung, J.Y.-T.: Handbook of Scheduling: Algorithms, Models and Performance Analysis. CRC Press, Inc., Boca Raton (2004)"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Mansour, Y., Patt-Shamir, B.: Many-to-one packet routing on grids. In: Proceedings of the 27th Annual Symposium on Theory of Computing (STOC 1995), pp. 258\u2013267 (1995)","DOI":"10.1145\/225058.225136"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Rabani, Y.: Universal O(congestion\u2009+\u2009dilation\u2009+\u2009log1\u2009+\u2009\u03b5 N) local control packet switching algorithms. In: Proceedings of the 29th annual ACM Symposium on Theory of Computing (STOC 1997), pp. 644\u2013653 (1997)","DOI":"10.1145\/258533.258659"},{"key":"29_CR18","first-page":"609","volume-title":"Infinite and Finite Sets Colloq. Math. Soc. Janos Bolyai","author":"P. Erd\u0151s","year":"1975","unstructured":"Erd\u0151s, P., Lov\u00e1sz, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Infinite and Finite Sets Colloq. Math. Soc. Janos Bolyai, vol.\u00a011, pp. 609\u2013627. North-Holland, Amsterdam (1975)"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-12450-1_20","volume-title":"Approximation and Online Algorithms","author":"B. Peis","year":"2010","unstructured":"Peis, B., Skutella, M., Wiese, A.: Packet routing: Complexity and algorithms. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 217\u2013228. Springer, Heidelberg (2010)"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-12200-2_12","volume-title":"LATIN 2010: Theoretical Informatics","author":"B. Peis","year":"2010","unstructured":"Peis, B., Skutella, M., Wiese, A.: Packet routing on the grid. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 120\u2013130. Springer, Heidelberg (2010)"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Peis, B., Wiese, A.: Universal packet routing with arbitrary bandwidths and transit times. Technical Report 024-2010, Technische Universit\u00e4t Berlin (November 2010)","DOI":"10.1007\/978-3-642-20807-2_29"},{"key":"29_CR22","first-page":"366","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC 1996)","author":"Y. Rabani","year":"1996","unstructured":"Rabani, Y., Tardos, \u00c9.: Distributed packet switching in arbitrary networks. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC 1996), pp. 366\u2013375. ACM, New York (1996)"},{"key":"29_CR23","unstructured":"Rajasekaran, S.: Randomized algorithms for packet routing on the mesh. Technical Report MS-CIS-91-92, Dept. of Computer and Information Sciences, Univ. of Pennsylvania, Philadelphia, PA (1991)"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Scheideler, C.: Universal Routing Strategies for Interconnection Networks. LNCS, vol.\u00a01390, pp. 57\u201371 (1998)","DOI":"10.1007\/BFb0052928"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Srinivasan, A., Teo, C.-P.: A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria. SIAM Journal on Computing\u00a030 (2001)","DOI":"10.1137\/S0097539798335596"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatoral Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20807-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,25]],"date-time":"2021-11-25T20:59:00Z","timestamp":1637873940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20807-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208065","9783642208072"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20807-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}