{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:27:27Z","timestamp":1743100047402,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":62,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_486","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:10:42Z","timestamp":1219662642000},"page":"2832-2844","source":"Crossref","is-referenced-by-count":6,"title":["Optimization Problems in Unit-Disk Graphs"],"prefix":"10.1007","author":[{"given":"B.","family":"Balasundaram","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Butenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"486_CR1_486","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.jalgor.2003.10.001","volume":"52","author":"J Alber","year":"2004","unstructured":"Alber J, Fiala J (2004) Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J\u00a0Algorithm 52(2):134\u2013151","journal-title":"J Algorithm"},{"key":"486_CR2_486","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1109\/JCN.2002.6596929","volume":"4","author":"KM Alzoubi","year":"2002","unstructured":"Alzoubi KM, Wan PJ, Frieder O (2002) Distributed heuristics for connected dominating sets in wireless ad hoc networks. J\u00a0Commun Netw 4:22\u201329","journal-title":"J Commun Netw"},{"key":"486_CR3_486","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl C, Erlebach T, Mihal'\u00e1k M, Nunkesser M (2006) Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: Diaz J, Jansen K, Rolim JDP, Zwick U (eds) Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques vol\u00a04110 of Lecture Notes in Computer Science. Springer. pp\u00a03\u201314","DOI":"10.1007\/11830924_3"},{"issue":"1","key":"486_CR4_486","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker BS (1994) Approximation algorithms for NP\u2011complete problems on planar graphs. J\u00a0ACM 41(1):153\u2013180","journal-title":"J ACM"},{"key":"486_CR5_486","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1007\/978-0-387-30165-5_30","volume-title":"Handbook of Optimization in Telecommunications","author":"B Balasundaram","year":"2006","unstructured":"Balasundaram B, Butenko S (2006) Graph domination, coloring and cliques in telecommunications. In: Resende MGC, Pardalos PM (eds) Handbook of Optimization in Telecommunications. Spinger, New York, pp\u00a0865\u2013890"},{"key":"486_CR6_486","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda R, Even S (1982) On approximating a\u00a0vertex cover for planar graphs. In: STOC '82: Proceeding of the Fourteenth Annual ACM Symposium on Theory of Computing, pp\u00a0303\u2013309","DOI":"10.1145\/800070.802205"},{"key":"486_CR7_486","first-page":"27","volume":"25","author":"R Bar-Yehuda","year":"1985","unstructured":"Bar-Yehuda R, Even S (1985) A\u00a0local-ratio theorem for approximating the weighted vertex cover problem. Ann Discret Math 25:27\u201346","journal-title":"Ann Discret Math"},{"key":"486_CR8_486","doi-asserted-by":"crossref","unstructured":"Basagni S (1999) Distributed clustering for ad hoc networks. In Proceedings of the (1999) International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99) p\u00a0310","DOI":"10.1109\/ISPAN.1999.778957"},{"key":"486_CR9_486","unstructured":"Breu H (1996) Algorithmic Aspects of Constrained Unit Disk Graphs, PhD thesis. University of British Columbia"},{"issue":"1\u20132","key":"486_CR10_486","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu H, Kirkpatrick DG (1998) Unit disk graph recognition is NP-hard. Comput Geometr Theory Appl\n\t    9(1\u20132):3\u201324","journal-title":"Comput Geometr Theory Appl"},{"key":"486_CR11_486","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks RL (1941) On coloring the nodes of a\u00a0network. Proc Cambridge Philos Soc 37:194\u2013197","journal-title":"Proc Cambridge Philos Soc"},{"key":"486_CR12_486","doi-asserted-by":"crossref","unstructured":"Butenko S, Cheng X, Du DZ, Pardalos P (2003) On the construction of virtual backbone for ad hoc wireless networks. In Butenko S, Murphey R, Pardalos PM (eds), Cooperative Control: Models, Applications and Algorithms. Kluwer Academic, pp\u00a043\u201354","DOI":"10.1007\/978-1-4757-3758-5_3"},{"key":"486_CR13_486","first-page":"263","volume-title":"Proceedings of the sixth annual ACM-SIAM symposium on discrete algorithms (SODA '95)","author":"PB Callahan","year":"1995","unstructured":"Callahan PB, Kosaraju SR (1995) Algorithms for dynamic closest pair and n-body potential fields. In: Proceedings of the sixth annual ACM-SIAM symposium on discrete algorithms (SODA '95). Society for Industrial and Applied Mathematics, Philadelphia, pp\u00a0263\u2013272"},{"key":"486_CR14_486","unstructured":"Cardei M, Cheng X, Cheng X, Du DZ (2002) Connected domination in multihop ad hoc wireless networks. In: Caulfield HJ, Chen SH, Cheng HD, Duro RJ, Honavar V, Kerre EE, Lu M, Romay MG, Shih TK, Wang DVPP, Yang Y (eds) Proceedings of the 6th Joint Conference on Information Science JCIS\/Association for Intelligent Machinery, Inc, pp\u00a0251\u2013255"},{"key":"486_CR15_486","first-page":"73","volume-title":"Latin-American Conference on Combinatorics, Graphs and Applications, vol 18 of Electronic Notes in Discrete Mathematics","author":"MR Cerioli","year":"2004","unstructured":"Cerioli MR, Faria L, Ferreira TO, Protti F (2004) On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: complexity and approximation. In: Latin-American Conference on Combinatorics, Graphs and Applications, vol\u00a018 of Electronic Notes in Discrete Mathematics. Elsevier, Amsterdam, pp\u00a073\u201379 (electronic)"},{"key":"486_CR16_486","unstructured":"Chatterjee M, Das S, Turgut D (2002) WCA: A\u00a0weighted clustering algorithm for mobile ad hoc networks. J\u00a0Cluster Computing, Special Issue on Mobile Ad hoc Netw 5:193\u2013204"},{"issue":"4","key":"486_CR17_486","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1002\/net.10097","volume":"42","author":"X Cheng","year":"2003","unstructured":"Cheng X, Huang X, Li D, Wu W, Du DZ (2003) A\u00a0polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Netw 42(4):202\u2013208","journal-title":"Netw"},{"key":"486_CR18_486","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark BN, Colbourn CJ, Johnson DS (1990) Unit disk graphs. Discret Math 86:165\u2013177","journal-title":"Discret Math"},{"key":"486_CR19_486","doi-asserted-by":"crossref","unstructured":"Das B, Bharghavan V (1997) Routing in ad-hoc networks using minimum connected dominating sets. In: Proceedings of IEEE International Conference on Communications, pp\u00a0376\u2013380","DOI":"10.1109\/ICC.1997.605303"},{"key":"486_CR20_486","unstructured":"Das B, Sivakumar R, Bharghavan V (1997) Routing in ad-hoc networks using a\u00a0virtual backbone. In: Proceedings of the International Conference on Computers and Communication Networks (IC3N), pp\u00a01\u201320"},{"issue":"1\u20133","key":"486_CR21_486","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/j.tcs.2007.02.013","volume":"377","author":"J Diaz","year":"2007","unstructured":"Diaz J, Kaminski M (2007) Max-cut and max-bisection are np-hard on unit disk graphs. Theoret Comput Sci 377(1\u20133):271\u2013276","journal-title":"Theoret Comput Sci"},{"issue":"1","key":"486_CR22_486","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/B:JOGO.0000006750.85332.0f","volume":"28","author":"H Du","year":"2004","unstructured":"Du H, Jia X, Li D, Wu W (2004) Coloring of double disk graphs. J\u00a0Global Optim 28(1):115\u2013119","journal-title":"J Global Optim"},{"key":"486_CR23_486","doi-asserted-by":"crossref","unstructured":"Erlebach T, Fiala J (2006) Independence and coloring problems on intersection graphs of disks. In: Bampis E, Jansen K, Kenyon C (eds) Efficient Approximation and Online Algorithms, vol\u00a03484 of Lecture Notes in Computer Science. Springer, pp\u00a0135\u2013155","DOI":"10.1007\/11671541_5"},{"key":"486_CR24_486","first-page":"671","volume-title":"SODA '01: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"T Erlebach","year":"2001","unstructured":"Erlebach T, Jansen K, Seidel E (2001) Polynomial-time approximation schemes for geometric graphs. In: SODA '01: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, pp\u00a0671\u2013679"},{"issue":"1","key":"486_CR25_486","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1137\/S0097539702431840","volume":"33","author":"G Even","year":"2004","unstructured":"Even G, Lotker Z, Ron D, Smorodinsky S (2004) Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM J Comput 33(1):94\u2013136","journal-title":"SIAM J Comput"},{"issue":"1\u20133","key":"486_CR26_486","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/j.tcs.2004.06.026","volume":"326","author":"J Fiala","year":"2004","unstructured":"Fiala J, Fishkin AV, Fomin F (2004) On distance constrained labeling of disk graphs. Theoret Comp Sci 326(1\u20133):261\u2013292","journal-title":"Theoret Comp Sci"},{"key":"486_CR27_486","first-page":"260","volume-title":"Approximation and Online Algorithms, vol 2909 of Lecture Notes in Computer Science","author":"AV Fishkin","year":"2004","unstructured":"Fishkin AV (2004) Disk graphs: A\u00a0short survey. In: Jansen K, Solis-Oba R (eds) Approximation and Online Algorithms, vol\u00a02909 of Lecture Notes in Computer Science. Springer, Berlin, pp\u00a0260\u2013264"},{"issue":"3","key":"486_CR28_486","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/1167935.1167941","volume":"2","author":"S Funke","year":"2006","unstructured":"Funke S, Kesselman A, Meyer U, Segal M (2006) A\u00a0simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans Sensor Netw 2(3):444\u2013453","journal-title":"ACM Trans Sensor Netw"},{"issue":"1","key":"486_CR29_486","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1137\/S0097539703436357","volume":"35","author":"J Gao","year":"2005","unstructured":"Gao J, Zhang L (2005) Well-separated pair decomposition for the unit-disk graph metric and its applications. SIAM J Comput 35(1):151\u2013169","journal-title":"SIAM J Comput"},{"key":"486_CR30_486","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and Intractability: A\u00a0Guide to the Theory of NP-completeness. WH Freeman, New York"},{"issue":"3","key":"486_CR31_486","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/PL00009196","volume":"20","author":"A Gr\u00e4f","year":"1998","unstructured":"Gr\u00e4f A, Stumpf M, Wei\u00dfenfels G (1998) On coloring unit disk graphs. Algorithmica 20(3):277\u2013293","journal-title":"Algorithmica"},{"key":"486_CR32_486","doi-asserted-by":"crossref","unstructured":"Gupta R, Walrand J (2004) Approximating maximal cliques in ad-hoc networks. In: Proceedings of the 15th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC '04), pp\u00a0365\u2013369","DOI":"10.1109\/PIMRC.2004.1370895"},{"issue":"12","key":"486_CR33_486","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale WK (1980) Frequency assignment: Theory and applications. Proc IEEE 68(12):1497\u20131514","journal-title":"Proc IEEE"},{"key":"486_CR34_486","unstructured":"Havel TF (1982) The Combinatorial Distance Geometry Approach to the Calculation of Molecular Conformation. PhD thesis, University of California, Berkeley"},{"key":"486_CR35_486","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.endm.2005.06.022","volume":"22","author":"F Havet","year":"2005","unstructured":"Havet F, Kang RJ, Sereni J-S (2005) Improper colouring of unit disk graphs. Electron Notes Discret Math 22:123\u2013128","journal-title":"Electron Notes Discret Math"},{"issue":"1\u20133","key":"486_CR36_486","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P Hlin\u011bn\u00fd","year":"2001","unstructured":"Hlin\u011bn\u00fd P, Kratochv\u00edl J (2001) Representing graphs by disks and balls (a\u00a0survey of recognition-complexity results). Discret Math 229(1\u20133):101\u2013124","journal-title":"Discret Math"},{"issue":"3","key":"486_CR37_486","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","volume":"6","author":"DS Hochbaum","year":"1983","unstructured":"Hochbaum DS (1983) Efficient bounds for the stable set, vertex cover and set packing problems. Discret Appl Math 6(3):243\u2013254","journal-title":"Discret Appl Math"},{"issue":"1","key":"486_CR38_486","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"DS Hochbaum","year":"1985","unstructured":"Hochbaum DS, Maass W (1985) Approximation schemes for covering and packing problems in image processing and vlsi. J\u00a0ACM 32(1):130\u2013136","journal-title":"J ACM"},{"issue":"2","key":"486_CR39_486","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1006\/jagm.1997.0903","volume":"26","author":"HB Hunt 3rd","year":"1998","unstructured":"Hunt HB 3rd, Marathe MV, Radhakrishnan V, Ravi SS, Rosenkrantz DJ, Stearns RE (1998) Nc-approximation schemes for np- and pspace-hard problems for geometric graphs. J\u00a0Algorithms 26(2):238\u2013274","journal-title":"J Algorithms"},{"key":"486_CR40_486","unstructured":"Krishna P, Chatterjee M, Vaidya NH, Pradhan DK (1995) A\u00a0cluster-based approach for routing in ad-hoc networks. In: Proceedings of the USENIX Symposium on Location Independent and Mobile Computing, pp\u00a01\u20138"},{"key":"486_CR41_486","doi-asserted-by":"crossref","unstructured":"Kuhn F, Moscibroda T, Wattenhofer R (2004) Unit disk graph approximation. In: Proceedings of the 2004 joint workshop on foundations of mobile computing (DIALM-POMC '04) ACM Press, New York, pp\u00a017\u201323","DOI":"10.1145\/1022630.1022634"},{"key":"486_CR42_486","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/941079.941089","volume-title":"Proceedings of the 2003 joint workshop on Foundations of mobile computing (DIALM-POMC '03)","author":"F Kuhn","year":"2003","unstructured":"Kuhn F, Zollinger A (2003) Ad-hoc networks beyond unit disk graphs. In: Proceedings of the 2003 joint workshop on Foundations of mobile computing (DIALM-POMC '03). ACM Press, New York, pp\u00a069\u201378"},{"key":"486_CR43_486","first-page":"145","volume":"54","author":"J Li","year":"2005","unstructured":"Li J, Liang X, Selveraj H, Muthukumar V, Gewali LP (2005) A\u00a0novel data structure for unit disk graphs. J\u00a0Comb Math Comb Comput 54:145\u2013156","journal-title":"J Comb Math Comb Comput"},{"issue":"1","key":"486_CR44_486","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/(SICI)1097-0037(199808)32:1<13::AID-NET2>3.0.CO;2-M","volume":"32","author":"E Malesi\u0144ska","year":"1998","unstructured":"Malesi\u0144ska E, Piskorz S, Wei\u00dfenfels G (1998) On the chromatic number of disk graphs. Networks 32(1):13\u201322","journal-title":"Networks"},{"key":"486_CR45_486","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"MV Marathe","year":"1995","unstructured":"Marathe MV, Breu H, Hunt HB 3rd, Ravi S, Rosenkrantz DJ (1995) Simple heuristics for unit disk graphs. Networks 25:59\u201368","journal-title":"Networks"},{"issue":"1\u20132","key":"486_CR46_486","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0304-3975(96)00008-4","volume":"174","author":"MV Marathe","year":"1997","unstructured":"Marathe MV, Radhakrishnan V, Hunt HB 3rd, Ravi SS (1997) Hierarchically specified unit disk graphs. Theor Comp Sci 174(1\u20132):23\u201365","journal-title":"Theor Comp Sci"},{"key":"486_CR47_486","doi-asserted-by":"crossref","unstructured":"Matsui T (2000) Approximation algorithms for maximum independent set problems and\n\t    fractional coloring problems on unit disk graphs. In: Akiyama J, Kano M, Urabe M (eds) Discrete and Computational Geometry, vol\u00a01763 of Lecture\n\t    Notes in Computer Science. Springer, pp\u00a0194\u2013200","DOI":"10.1007\/978-3-540-46515-7_16"},{"issue":"1","key":"486_CR48_486","first-page":"444","volume":"35","author":"M Min","year":"2006","unstructured":"Min M, Du H, Jia X, Huang CX, Huang SC-H, Wu W (2006) Improving construction for connected dominating set with steiner tree in wireless sensor networks. J\u00a0Global Optim 35(1):444\u2013453","journal-title":"J Global Optim"},{"key":"486_CR49_486","first-page":"895","volume-title":"Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (SODA '05)","author":"Y Miyamoto","year":"2005","unstructured":"Miyamoto Y, Matsui T (2005) Multicoloring unit disk graphs on triangular lattice points. In: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms (SODA '05). Society for Industrial and Applied Mathematics, Philadelphia, pp\u00a0895\u2013896"},{"key":"486_CR50_486","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"GL Nemhauser","year":"1975","unstructured":"Nemhauser GL, Trotter LE (1975) Vertex packing: structural properties and algorithms. Math Program 8:232\u2013248","journal-title":"Math Program"},{"key":"486_CR51_486","doi-asserted-by":"crossref","unstructured":"Nieberg T, Hurink J, Kern W (2004) A\u00a0robust PTAS for maximum weight independent sets in unit disk graphs. In: Hromkovic J, Nagl M, Westfechtel B (eds) Graph-Theoretic Concepts in Computer Science, vol\u00a03353 of Lecture Notes in Computer Science. Springer, pp\u00a0214\u2013221","DOI":"10.1007\/978-3-540-30559-0_18"},{"key":"486_CR52_486","doi-asserted-by":"crossref","unstructured":"Nieberg T, Hurink JL (2006) A\u00a0PTAS for the minimum dominating set problem in unit disk graphs. In: Erlebach T, Persiano G (eds) Approximation and Online Algorithms, vol\u00a03879 of Lecture Notes in Computer Science. Springer, pp\u00a0296\u2013306","DOI":"10.1007\/11671411_23"},{"issue":"3","key":"486_CR53_486","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/net.10111","volume":"43","author":"J Nolan","year":"2004","unstructured":"Nolan J (2004) Bisectored unit disk graphs. Networks 43(3):141\u2013152","journal-title":"Networks"},{"key":"486_CR54_486","unstructured":"Peeters R (1991) On coloring j-unit sphere graphs. Technical report, Department of Economics, Tilburg University"},{"issue":"1","key":"486_CR55_486","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/S0196-6774(03)00048-8","volume":"48","author":"V Raghavan","year":"2003","unstructured":"Raghavan V, Spinrad J (2003) Robust algorithms for restricted domains. J\u00a0Algorithm 48(1):160\u2013172","journal-title":"J Algorithm"},{"key":"486_CR56_486","doi-asserted-by":"crossref","unstructured":"Ramaswami R, Parhi KK (1989) Distributed scheduling of broadcasts in a\u00a0radio network. In: Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM '89) vol\u00a02, pp\u00a0497\u2013504","DOI":"10.1109\/INFCOM.1989.101493"},{"key":"486_CR57_486","doi-asserted-by":"crossref","unstructured":"Stojmenovic I (ed) (2002) Handbook of Wireless Networks and Mobile Computing. Wiley InterScience","DOI":"10.1002\/0471224561"},{"key":"486_CR58_486","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0021-9800(68)80081-X","volume":"4","author":"G Szekeres","year":"1968","unstructured":"Szekeres G, Wilf HS (1968) An inequality for the chromatic number of a\u00a0graph. J\u00a0Comb Theory 4:1\u20133","journal-title":"J Comb Theory"},{"key":"486_CR59_486","first-page":"351","volume-title":"Graph-theoretic concepts in computer science, vol 3787 of Lecture Notes in Computer Science","author":"EJ van Leeuwen","year":"2005","unstructured":"van Leeuwen EJ (2005) Approximation algorithms for unit disk graphs. In: Kratsch D (ed) Graph-theoretic concepts in computer science, vol\u00a03787 of Lecture Notes in Computer Science. Springer, Berlin, pp\u00a0351\u2013361"},{"issue":"2","key":"486_CR60_486","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1023\/B:MONE.0000013625.87793.13","volume":"9","author":"P-J Wan","year":"2004","unstructured":"Wan P-J, Alzoubi KM, Frieder O (2004) Distributed construction of connected dominating set in wireless ad hoc networks. Mobile Netw Appl 9(2):141\u2013149","journal-title":"Mobile Netw Appl"},{"issue":"6","key":"486_CR61_486","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0020-0190(88)90174-3","volume":"28","author":"DW Wang","year":"1988","unstructured":"Wang DW, Kuo Y-S (1988) A\u00a0study on two geometric location problems. Informat Proc Let 28(6):281\u2013286","journal-title":"Informat Proc Let"},{"issue":"1","key":"486_CR62_486","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2005.08.037","volume":"352","author":"W Wu","year":"2006","unstructured":"Wu W, Du H, Jia X, Li Y, Huang SC-H (2006) Minimum connected dominating sets and maximal independent sets in unit disk graphs. Theoret Comp Sci 352(1):1\u20137","journal-title":"Theoret Comp Sci"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:13:14Z","timestamp":1720692794000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_486","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}