{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:13Z","timestamp":1763467933565,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_37","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"447-458","source":"Crossref","is-referenced-by-count":32,"title":["Improved Algorithms for Latency Minimization in Wireless Networks"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Fangh\u00e4nel","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Ke\u00dfelheim","sequence":"additional","affiliation":[]},{"given":"Berthold","family":"V\u00f6cking","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-59042-0_81","volume-title":"STACS 95","author":"F. Meyer auf der Heide","year":"1995","unstructured":"Meyer auf der Heide, F., V\u00f6cking, B.: A packet routing protocol for arbitrary networks. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 291\u2013302. Springer, Heidelberg (1995)"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Banerjee, S., Misra, A.: Minimum energy paths for reliable communication in multi-hop wireless networks. In: Proceedings of the 3rd ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 146\u2013156 (2002)","DOI":"10.1145\/513800.513818"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Bansal, N., Liu, Z.: Capacity, delay and mobility in wireless ad-hoc networks. In: Conference of the IEEE Communications Society (INFOCOM), vol.\u00a02, pp. 1553\u20131563 (2003)","DOI":"10.1109\/INFCOM.2003.1208990"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Chafekar, D., Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Cross-layer latency minimization in wireless networks with SINR constraints. In: Proceedings of the 8th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 110\u2013119 (2007)","DOI":"10.1145\/1288107.1288123"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Chafekar, D., Anil Kumar, V.S., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Approximation algorithms for computing capacity of wireless networks with SINR constraints. In: Proceedings of the 27th Conference of the IEEE Communications Society (INFOCOM), pp. 1166\u20131174 (2008)","DOI":"10.1109\/INFOCOM.2008.172"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"Fangh\u00e4nel, A., Ke\u00dfelheim, T., R\u00e4cke, H., V\u00f6cking, B.: Oblivious interference scheduling. In: PODC 2009 (submitted, 2009)","DOI":"10.1145\/1582716.1582752"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1109\/18.825799","volume":"46","author":"P. Gupta","year":"2000","unstructured":"Gupta, P., Kumar, P.R.: The capacity of wireless networks. IEEE Transactions on Information Theory\u00a046, 388\u2013404 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"37_CR8","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1109\/JSAC.2004.830909","volume":"22","author":"S. Thite","year":"2004","unstructured":"Thite, S., Balakrishnan, H., Barrett, C.L., Kumar, V.S.A., Marathe, M.V.: The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks. IEEE Journal on Selected Areas in Communications\u00a022(6), 1069\u20131079 (2004)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Kozat, U.C., Tassiulas, L.: Network layer support for service discovery in mobile ad hoc networks. In: Proceedings of the 22nd Conference of the IEEE Communications Society (INFOCOM), pp. 1965\u20131975 (2003)","DOI":"10.1109\/INFCOM.2003.1209218"},{"issue":"6","key":"37_CR10","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1023\/A:1012311216333","volume":"7","author":"S.O. Krumke","year":"2001","unstructured":"Krumke, S.O., Marathe, M.V., Ravi, S.S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks\u00a07(6), 575\u2013584 (2001)","journal-title":"Wireless Networks"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Leighton, F.T., Maggs, B.M., Ranade, A.G., Rao, S.B.: Randomized routing and sorting on fixed-connection networks. Journal of Algorithms (1994)","DOI":"10.1006\/jagm.1994.1030"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job-shop scheduling in O(congestion+dilation) steps. Combinatorica (1994)","DOI":"10.1007\/BF01215349"},{"key":"37_CR13","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How optimal are wireless scheduling protocols? In. In: Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM), pp. 1433\u20131441 (2007)","DOI":"10.1109\/INFCOM.2007.169"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: Proceedings of the 25th Conference of the IEEE Communications Society (INFOCOM), pp. 1\u201313 (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R., Zollinger, A.: Topology control meets SINR: The scheduling complexity of arbitrary topologies. In: Proceedings of the 7th ACM International Symposium Mobile Ad-Hoc Networking and Computing (MOBIHOC), pp. 310\u2013321 (2006)","DOI":"10.1145\/1132905.1132939"},{"issue":"4","key":"37_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Tompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07(4), 365\u2013374 (1987)","journal-title":"Combinatorica"},{"issue":"4","key":"37_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/144191.144283","volume":"22","author":"S. Ramanathan","year":"1992","unstructured":"Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multi-hop radio networks. ACM SIGCOMM Computer Communication Review\u00a022(4), 211\u2013222 (1992)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Srinivasan, A., Teo, C.-P.: A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria. In: STOC 1997: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, New York, USA, pp. 636\u2013643 (1997)","DOI":"10.1145\/258533.258658"},{"issue":"6","key":"37_CR19","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1023\/A:1020716919751","volume":"7","author":"J.E. Wieselthier","year":"2002","unstructured":"Wieselthier, J.E., Nguyen, G.D., Ephremides, A.: Energy-efficient broadcast and multicast trees in wireless networks. Mobile Networks and Applications (MONET)\u00a07(6), 481\u2013492 (2002)","journal-title":"Mobile Networks and Applications (MONET)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T20:48:29Z","timestamp":1552078109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}