On the parameterized complexity of the Maximum Exposure Problem

DOI10.1016/J.IPL.2022.106338MaRDI QIDQ2680233zbMATH OpenOpenAlexFDO

Authors Remi Raman, Shahin John J. S., Subashini R, Subhasree Methirumangalath

Publication date 30 January 2023

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2203.11114

zbMATH Keywords

computational geometrymaximum exposure problemparameterized complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• The Parameterized Complexity of Maximality and Minimality Problems
• The parameterized complexity of maximality and minimality problems
• Complexity and approximability of parameterized MAX-CSPs
• Complexity and Approximability of Parameterized MAX-CSPs
• On the parameterized complexity of the expected coverage problem
• On the Parameterized Complexity of the Expected Coverage Problem
• Parameterized complexity and kernelizability of max ones and exact ones problems
• Parameterized complexity and kernelizability of Max Ones and Exact Ones problems
• On the Parameterized Complexity of Maximum Degree Contraction Problem.
• On the parameterized complexity of maximum degree contraction problem

Cites work

• Balanced Judicious Bipartition is Fixed-Parameter Tractable
• Fundamentals of parameterized complexity
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
• Parameterized algorithms
• Parameterized complexity of multi-node hubs
• The maximum exposure problem

This page was built for publication: On the parameterized complexity of the Maximum Exposure Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2680233)