{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T18:21:03Z","timestamp":1776277263959,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642034169","type":"print"},{"value":"9783642034176","type":"electronic"}],"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-03417-6_17","type":"book-chapter","created":{"date-parts":[[2009,8,5]],"date-time":"2009-08-05T03:57:54Z","timestamp":1249444674000},"page":"169-178","source":"Crossref","is-referenced-by-count":27,"title":["Maximum Independent Set of Links under Physical Interference Model"],"prefix":"10.1007","author":[{"given":"Peng-Jun","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frances","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Andrews, M., Dinitz, M.: Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory. In: Proc. of the 28th IEEE INFOCOM (April 2009)","DOI":"10.1109\/INFCOM.2009.5062048"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bateman, P., Erd\u00f6s, P.: Geometrical extrema suggested by a lemma of besicovitch. The American Mathematical Monthly, 306\u2013314 (May 1951)","DOI":"10.1080\/00029890.1951.11999682"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Oswald, Y.A., Wattenhofer, R.: Complexity in geometric SINR. In: Proc. of the 8th ACM MOBIHOC, September 2007, pp. 100\u2013109 (2007)","DOI":"10.1145\/1288107.1288122"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Halldorsson, M., Wattenhofer, R., Welzl, E.: Capacity of Arbitrary Wireless Networks. In: Proc. of the 28th IEEE INFOCOM (April 2009)","DOI":"10.1109\/INFCOM.2009.5062108"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF01159721","volume":"73","author":"H. Groemer","year":"1960","unstructured":"Groemer, H.: \u00dcber die Einlagerung von Kreisen in einen konvexen Bereich. Math. Zeitschrift.\u00a073, 285\u2013294 (1960)","journal-title":"Math. Zeitschrift."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Xu, X.-H., Tang, S.-J.: A Constant Approximation Algorithm for Link Scheduling in Arbitrary Networks under Physical Interference Model. In: The Second ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing (May 2009)","DOI":"10.1145\/1540343.1540347"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03417-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T17:24:53Z","timestamp":1558459493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03417-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034169","9783642034176"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03417-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}