{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:39:55Z","timestamp":1725521995214},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540928614"},{"type":"electronic","value":"9783540928621"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92862-1_6","type":"book-chapter","created":{"date-parts":[[2008,12,12]],"date-time":"2008-12-12T05:14:49Z","timestamp":1229058889000},"page":"57-71","source":"Crossref","is-referenced-by-count":8,"title":["Link Scheduling in Local Interference Models"],"prefix":"10.1007","author":[{"given":"Bastian","family":"Katz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"V\u00f6lker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Schmidt, S., Wattenhofer, R.: Algorithmic Models for Sensor Networks. In: 20th IEEE Int. Parallel and Distributed Processing Symposium (IPDPS 2006), pp. 450\u2013459 (2007)","DOI":"10.1109\/IPDPS.2006.1639417"},{"key":"6_CR2","volume-title":"Wireless Communications: Principles and Practices","author":"T. Rappaport","year":"1996","unstructured":"Rappaport, T.: Wireless Communications: Principles and Practices. Prentice-Hall, Englewood Cliffs (1996)"},{"issue":"2","key":"6_CR3","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(2), 388\u2013404 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR4","unstructured":"Moscibroda, T., Wattenhofer, R., Weber, Y.: Protocol Design Beyond Graph-Based Models. In: Proc. of the 5th Workshop on Hot Topics in Networks (HotNets) (2006)"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Hunt, H., Marathe, M., Radhakrishnan, V., Ravi, S., Rosenkrantz, D., Stearns, R.: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. Journal of Algorithms\u00a026 (1998)","DOI":"10.1006\/jagm.1997.0903"},{"key":"6_CR6","first-page":"575","volume":"6","author":"S.O. Krumke","year":"2000","unstructured":"Krumke, S.O., Marathe, M., Ravi, S.S.: Models and approximation algorithms for channel assignment in radio networks. Wireless Networks\u00a06, 575\u2013584 (2000)","journal-title":"Wireless Networks"},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"4005","DOI":"10.1016\/j.adhoc.2003.09.002","volume":"2","author":"P. Bj\u00f6rklund","year":"2004","unstructured":"Bj\u00f6rklund, P., V\u00e4rbrand, P., Yuan, D.: A Column Generation Method for Spatial TDMA Scheduling in Ad hoc Networks. Ad Hoc Networks\u00a02(4), 4005\u20134418 (2004)","journal-title":"Ad Hoc Networks"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1145\/1288107.1288122","volume-title":"Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC 2007)","author":"O. Goussevskaia","year":"2007","unstructured":"Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in Geometric SINR. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC 2007), pp. 100\u2013109. ACM Press, New York (2007)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-77444-0_3","volume-title":"Distributed Computing and Networking","author":"T. Locher","year":"2008","unstructured":"Locher, T., von Rickenbach, P., Wattenhofer, R.: Sensor Networks Continue to Puzzle: Selected Open Problems. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol.\u00a04904, pp. 25\u201338. Springer, Heidelberg (2008)"},{"issue":"5","key":"6_CR10","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1109\/18.21215","volume":"34","author":"B. Hajek","year":"1988","unstructured":"Hajek, B., Sasaki, G.: Link Scheduling in Polynomial Time. IEEE Transactions on Information Theory\u00a034(5), 910\u2013917 (1988)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR11","unstructured":"Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: End-to-end packet scheduling in wireless ad-hoc networks. In: Proc. of the 15th annual ACM-SIAM symposium on Discrete Algorithms (SODA 2004), pp. 1021\u20131030 (2004)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Coloring Unstructured Radio Networks. In: Proc. of the 17th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA 2005) (2005)","DOI":"10.1145\/1073970.1073977"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Behzad, A., Rubin, I.: On the Performance of Graph-based Scheduling Algorithms for Packet Radio Networks. In: Proc. of the IEEE Global Telecommunications Conference (GLOBECOM) (2003)","DOI":"10.1109\/GLOCOM.2003.1258872"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Gr\u00f6nkvist, J., Hansson, A.: Comparison Between Graph-Based and Interference-Based STDMA Scheduling. In: Proc. of the 2nd ACM International Symposium on Mobile Ad Hoc Networking & Computing (MOBIHOC), pp. 255\u2013258 (2001)","DOI":"10.1145\/501416.501453"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The Complexity of Connectivity in Wireless Networks. In: Proceedings of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2006) (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Oswald, Y.A., Wattenhofer, R.: How Optimal are Wireless Scheduling Protocols? In: Proceedings of the 26th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2007) (2007)","DOI":"10.1109\/INFCOM.2007.169"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N. Linial","year":"1992","unstructured":"Linial, N.: Locality in Distributed Graph Algorithms. SIAM Journal on Computing\u00a021, 193\u2013201 (1992)","journal-title":"SIAM Journal on Computing"},{"issue":"6","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1137\/S0097539793254571","volume":"24","author":"M. Naor","year":"1995","unstructured":"Naor, M., Stockmeyer, L.: What can be computed locally? SIAM Journal on Computing\u00a024(6), 1259\u20131277 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: The Price of Being Near-Sighted. In: Proc. of the 17th ACM\u2013SIAM Symp. on Discrete Algorithms (SODA 2006) (2006)","DOI":"10.1145\/1109557.1109666"},{"issue":"5","key":"6_CR20","doi-asserted-by":"publisher","first-page":"999","DOI":"10.2307\/2035601","volume":"16","author":"L.F. Toth","year":"1965","unstructured":"Toth, L.F.: Minkowskian distribution of discs. Proceedings of the AMS\u00a016(5), 999\u20131004 (1965)","journal-title":"Proceedings of the AMS"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects of Wireless Sensor Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92862-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T02:13:22Z","timestamp":1557972802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92862-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540928614","9783540928621"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92862-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}