Choice is hard

DOI10.1007/978-3-662-48971-0_28MaRDI QIDQ3459872zbMATH OpenOpenAlexFDO

Authors Esther M. Arkin, Aritra Banik, Paz Carmi, Gui Citovsky, Joseph S. B. Mitchell, Marina Simakov, 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

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Selecting and covering colored points
• The interval constrained 3-coloring problem
• The class cover problem with boxes
• The interval constrained 3-coloring problem
• Color spanning objects: algorithms and hardness results

Cited in

(12)

• Selecting and covering colored points
• On the difficulty of making social choices
• Approximation algorithms for geometric conflict free covering problems
• On the parameterized complexity of party nominations
• Polynomial time algorithms for bichromatic problems
• Exploring the kernelization borders for hitting cycles
• On Covering Segments with Unit Intervals
• Parameterized complexity of conflict-free set cover
• Conflict free version of covering problems on graphs: classical and parameterized
• Parameterized complexity of geometric covering problems having conflicts
• On fair division with binary valuations respecting social networks
• Fréchet distance between a line and avatar point set

This page was built for publication: Choice is hard

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