Amanote Research
Register
Sign In
Settling the APX-Hardness Status for Geometric Set Cover
doi 10.1109/focs.2014.64
Full Text
Open PDF
Abstract
Available in
full text
Date
October 1, 2014
Authors
Nabil H. Mustafa
Rajiv Raman
Saurabh Ray
Publisher
IEEE
Related search
Accessible Player Experiences (APX): The Players
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
The Wobbly Logic Engine: Proving Hardness of Non-Rigid Geometric Graph Representation Problems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Online and Dynamic Algorithms for Set Cover
The Cover Time of Random Geometric Graphs
A Heuristic Approach for Minimum Set Cover Problem
International Journal of Advanced Research in Artificial Intelligence
Geometric Fit of a Point Set by Generalized Circles
Journal of Global Optimization
Control
Optimization
Applied Mathematics
Management Science
Computer Science Applications
Operations Research
Geometric Separation and Exact Solutions for the Parameterized Independent Set Problem on Disk Graphs
The S1-Cw Decomposition of the Geometric Realization of a Cyclic Set
Fundamenta Mathematicae
Number Theory
Algebra
Making the Most of Settling for Less
FORUM (Netherlands)
Linguistics
Literature
Literary Theory
Language
