Theoretical complexity of grid cover problems used in radar applications

DOI10.1007/s10957-018-1354-xzbMath1440.05058OpenAlexW2887531599MaRDI QIDQ1626552

Yann Briheche, Fouad Bennis, Damien Chablat, Frédéric Barbaresco

Publication date: 27 November 2018

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-018-1354-x

zbMATH Keywords

combinatorial optimizationNP-hardnessset cover problemgrid coveringradar resource management

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Dynamic programming (90C39) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorial aspects of packing and covering (05B40)

Related Items

Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns

Cites Work

• Exact algorithms and APX-hardness results for geometric packing and covering problems
• Optimization in public transportation. Stop location, delay management and tariff zone design in a public transportation network
• Completeness in approximation classes beyond APX
• The Design of Approximation Algorithms
• A PTAS for the Weighted Unit Disk Cover Problem
• A Greedy Heuristic for the Set-Covering Problem
• On Finding Primal- and Dual-Optimal Bases
• On the hardness of approximating minimization problems
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item