On the parameterized complexity of the Maximum Exposure Problem

DOI10.1016/j.ipl.2022.106338OpenAlexW4306804070MaRDI QIDQ2680233

Remi Raman, Subashini R, Shahin John J. S., 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 geometryparameterized complexitymaximum exposure problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Parameterized complexity of multi-node hubs
• The maximum exposure problem
• Multi-parameter analysis for local graph partitioning problems: using greediness for parameterization
• Parameterized algorithms for graph partitioning problems
• Balanced Judicious Bipartition is Fixed-Parameter Tractable
• Parameterized Algorithms

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