Choice Is Hard
From MaRDI portal
Publication:3459872
DOI10.1007/978-3-662-48971-0_28zbMath1472.68061OpenAlexW2397265210MaRDI QIDQ3459872
Paz Carmi, Aritra Banik, Marina Simakov, Gui Citovsky, Joseph S. B. Mitchell, Esther M. Arkin, Matthew J. Katz
Publication date: 11 January 2016
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-48971-0_28
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
On fair division with binary valuations respecting social networks, Polynomial Time Algorithms for Bichromatic Problems, Approximation algorithms for geometric conflict free covering problems, Covering segments with unit squares, Exploring the Kernelization Borders for Hitting Cycles, Fréchet distance between a line and avatar point set, Conflict free version of covering problems on graphs: classical and parameterized, On the parameterized complexity of party nominations, Parameterized complexity of conflict-free set cover, Selecting and covering colored points, Parameterized complexity of geometric covering problems having conflicts, On Covering Segments with Unit Intervals
