ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE

DOI10.15826/umj.2016.2.010zbMath1396.68127MaRDI QIDQ4581438

Mikhail Yu. Khachay, Daniel M. Khachai

Publication date: 17 August 2018

Published in: Ural mathematical journal (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/umj25

zbMATH Keywords

dynamic programming; computational geometry; parameterized complexity; hitting set problem

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Uses Software

• AdaBoost.MH