{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:50Z","timestamp":1725879710277},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_29","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:13:23Z","timestamp":1486030403000},"page":"332-343","source":"Crossref","is-referenced-by-count":2,"title":["Finding Large Independent Sets in Line of Sight Networks"],"prefix":"10.1007","author":[{"given":"Pavan","family":"Sangha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michele","family":"Zito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"29_CR1","volume-title":"Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties. Springer, Berlin (1999)"},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0020-0190(97)00164-6","volume":"64","author":"M Cesati","year":"1997","unstructured":"Cesati, M., Trevisan, L.: On the efficiency of polynomial time approximation schemes. Inf. Process. Lett. 64, 165\u2013171 (1997)","journal-title":"Inf. Process. Lett."},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86, 165\u2013177 (1990)","journal-title":"Discret. Math."},{"key":"29_CR4","first-page":"71","volume":"15","author":"L Devroye","year":"2013","unstructured":"Devroye, L., Farczadi, L.: Connectivity for line-of-sight-networks in higher dimensions. Discret. Math. Theor. Comput. Sci. 15, 71\u201386 (2013)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G Battista Di","year":"1994","unstructured":"Di Battista, G., Eades, P., Tamassia, R., Tollis, I.: Algorithms for drawing graphs. An annotated bibliography. Comput. Geom.: Theory Appl. 4, 235\u2013282 (1994)","journal-title":"Comput. Geom.: Theory Appl."},{"key":"29_CR6","volume-title":"Graph Theory","author":"R Diestel","year":"1999","unstructured":"Diestel, R.: Graph Theory. Springer, New York (1999)"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1017\/S0963548308009334","volume":"18","author":"A Frieze","year":"2009","unstructured":"Frieze, A., Kleinberg, J., Ravi, R., Debani, W.: Line of sight networks. Comb. Probab. Comput. 18, 142\u2013163 (2009)","journal-title":"Comb. Probab. Comput."},{"key":"29_CR8","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. Freeman and Company, New York (1979)"},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $$n^{1-\\varepsilon }$$ n 1 - \u03b5 . Acta Math. 182, 105\u2013142 (1999)","journal-title":"Acta Math."},{"key":"29_CR10","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CA Hurkens","year":"1989","unstructured":"Hurkens, C.A., Schrijver, A.: On the size of sets every $$t$$ t of which have an SDR, with an application to the worst case ratio of heuristics for packing problems. SIAM J. Discret. Math. 2, 68\u201372 (1989)","journal-title":"SIAM J. Discret. Math."},{"key":"29_CR11","volume-title":"Matching Theory","author":"L Lovasz","year":"1986","unstructured":"Lovasz, L.: Matching Theory. North Holland, Amsterdam (1986)"},{"key":"29_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"MV Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt, H.B., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk. Graphs Netw. 25, 59\u201368 (1995)","journal-title":"Graphs Netw."},{"key":"29_CR13","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. John Hopkins University Press, Baltimore (2001)"},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-30559-0_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T Nieberg","year":"2004","unstructured":"Nieberg, T., Hurink, J., Kern, W.: A robust PTAS for maximum weight independent sets in unit disk graphs. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 214\u2013221. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30559-0_18"},{"key":"29_CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(02)00200-7","volume":"126","author":"D Peterson","year":"2003","unstructured":"Peterson, D.: Gridline graphs: a review in two dimensions and an extension to higher dimensions. Discret. Appl. Math. 126, 223\u2013239 (2003)","journal-title":"Discret. Appl. Math."},{"key":"29_CR16","volume-title":"Stochastic Geometry and Its Applications","author":"D Stoyan","year":"1995","unstructured":"Stoyan, D., Kendall, W.S., Mecke, J., Ruschendorf, L.: Stochastic Geometry and Its Applications, vol. II. Wiley, Chichester (1995)"},{"key":"29_CR17","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","volume":"C\u201330","author":"L Valiant","year":"1981","unstructured":"Valiant, L.: Universality considerations in VLSI circuits. IEEE Trans. Comput. C\u201330, 135\u2013140 (1981)","journal-title":"IEEE Trans. Comput."},{"key":"29_CR18","unstructured":"Wood, D.R.: On higher-dimensional orthogonal graph drawing. In: Australian Computer Science Communications - CATS 1997 Proceedings of the Computing: The Australasian Theory Symposium, pp. 3\u20138. Australian Computer Science Association, Melbourne (1997)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T01:27:28Z","timestamp":1692667648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}