Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
Author
Abstract
Suggested Citation
DOI: 10.1287/ijoc.2020.1045
Download full text from publisher
References listed on IDEAS
- Renhua Li & Leonie U Hempel & Tingbo Jiang, 2015. "A Non-Parametric Peak Calling Algorithm for DamID-Seq," PLOS ONE, Public Library of Science, vol. 10(3), pages 1-12, March.
- Jochen Alber & Nadja Betzler & Rolf Niedermeier, 2006. "Experiments on data reduction for optimal domination in networks," Annals of Operations Research, Springer, vol. 146(1), pages 105-117, September.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Carlos V. G. C. Lima & Dieter Rautenbach & Uéverton S. Souza & Jayme L. Szwarcfiter, 2022. "On the computational complexity of the bipartizing matching problem," Annals of Operations Research, Springer, vol. 316(2), pages 1235-1256, September.
- Marjan Marzban & Qian-Ping Gu & Xiaohua Jia, 2016. "New analysis and computational study for the planar connected dominating set problem," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 198-225, July.
- Van Bang Le & Sheng-Lung Peng, 2018. "On the complete width and edge clique cover problems," Journal of Combinatorial Optimization, Springer, vol. 36(2), pages 532-548, August.
- Goharshady, Amir Kafshdar & Mohammadi, Fatemeh, 2020. "An efficient algorithm for computing network reliability in small treewidth," Reliability Engineering and System Safety, Elsevier, vol. 193(C).
- Danny Hermelin & Shlomo Karhi & Michael Pinedo & Dvir Shabtay, 2021. "New algorithms for minimizing the weighted number of tardy jobs on a single machine," Annals of Operations Research, Springer, vol. 298(1), pages 271-287, March.
- Johannes Blum, 2022. "W[1]-hardness of the k-center problem parameterized by the skeleton dimension," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2762-2781, November.
- Duv{s}an Knop & v{S}imon Schierreich, 2023. "Host Community Respecting Refugee Housing," Papers 2302.13997, arXiv.org, revised Mar 2023.
- Hans L. Bodlaender & Josse Dobben de Bruyn & Dion Gijswijt & Harry Smit, 2022. "Constructing tree decompositions of graphs with bounded gonality," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2681-2699, November.
- Édouard Bonnet & Sergio Cabello, 2021. "The complexity of mixed-connectivity," Annals of Operations Research, Springer, vol. 307(1), pages 25-35, December.
- Fomin, Fedor V. & Fraigniaud, Pierre & Golovach, Petr A., 2022. "Present-biased optimization," Mathematical Social Sciences, Elsevier, vol. 119(C), pages 56-67.
- Klaus Heeger & Danny Hermelin & George B. Mertzios & Hendrik Molter & Rolf Niedermeier & Dvir Shabtay, 2023. "Equitable scheduling on a single machine," Journal of Scheduling, Springer, vol. 26(2), pages 209-225, April.
- Juho Lauri & Sourav Dutta & Marco Grassia & Deepak Ajwani, 2023. "Learning fine-grained search space pruning and heuristics for combinatorial optimization," Journal of Heuristics, Springer, vol. 29(2), pages 313-347, June.
- Niels Lindner & Julian Reisch, 2022. "An analysis of the parameterized complexity of periodic timetabling," Journal of Scheduling, Springer, vol. 25(2), pages 157-176, April.
- Gramm, Jens & Guo, Jiong & Huffner, Falk & Niedermeier, Rolf & Piepho, Hans-Peter & Schmid, Ramona, 2007. "Algorithms for compact letter displays: Comparison and evaluation," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 725-736, October.
- Lucci, Mauro & Nasini, Graciela & Severín, Daniel, 2024. "Solving the List Coloring Problem through a branch-and-price algorithm," European Journal of Operational Research, Elsevier, vol. 315(3), pages 899-912.
- Rim Wersch & Steven Kelk & Simone Linz & Georgios Stamoulis, 2022. "Reflections on kernelizing and computing unrooted agreement forests," Annals of Operations Research, Springer, vol. 309(1), pages 425-451, February.
More about this item
Keywords
connected spanning subgraphs; monitoring areas; reconnecting sensor networks; parameterized complexity analysis; approximation hardness; parameterization above lower bounds; color-coding; experimental comparison;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orijoc:v:34:y:2022:i:1:p:55-75. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.