Selecting and covering colored points
type: Item
instance of: scholarly article
title: Selecting and covering colored points
zbMATH Open document ID: 1398.05212
author: Esther M. Arkin
author: Aritra Banik
author: Paz Carmi
author: Gui Citovsky
author: Matthew J. Katz
author: Joseph S. B. Mitchell
author: Marina Simakov
published in: Discrete Applied Mathematics
publication date: 2018-10-26T00:00:00Z
Mathematics Subject Classification ID: 05D10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6966402
zbMATH Keywords: color classes
zbMATH Keywords: selecting and covering
zbMATH Keywords: 3-SAT
zbMATH Keywords: NP-hardness
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
full work available at URL: j.dam.2018.05.011
OpenAlex ID: W2805761617
cites work: Approximating the tree and tour covers of a graph
cites work: Minimum-diameter covering problems
cites work: Bichromatic 2-center of pairs of points
cites work: Choice Is Hard
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: Q5503674
cites work: Geometric Avatar Problems
cites work: The complexity of theorem-proving procedures
cites work: A dichotomy theorem for maximum generalized satisfiability problems.
cites work: Some Theorems on Abstract Graphs
cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae
cites work: Optimal packing and covering in the plane are NP-complete
cites work: The Approximability of the Binary Paintshop Problem
cites work: On alternativep-center problems
cites work: Q4142699
cites work: The approximability of constraint satisfaction problems
cites work: Nested satisfiability
cites work: Planar Formulae and Their Uses
cites work: Note on Hamilton Circuits
cites work: The hidden algorithm of Ore's theorem on Hamiltonian cycles
cites work: Some Matching Problems for Bipartite Graphs
cites work: A simplified NP-complete satisfiability problem
Wikidata QID: Q129752016
DOI: 10.1016/J.DAM.2018.05.011
description: scientific article; zbMATH DE number 6966402