On Geometric Set Cover for Orthants (Q5075763): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
On Geometric Set Cover for Orthants
Property / cites work
 
Property / cites work: Near-Linear Algorithms for Geometric Hitting Sets and Set Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Covering and Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random knapsack in expected polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost optimal set covers in finite VC-dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms and APX-hardness results for geometric packing and covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal range searching on the RAM, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for geometric set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341481 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of dominating set in geometric intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4027320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Multiobjective Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: PTAS for Weighted Set Cover on Unit Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packing and covering in the plane are NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and Covering with Non-Piercing Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: An ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximately dominating representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Set Cover and Hitting Sets for Polytopes in R / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Independence and Domination on Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: The limited blessing of low dimensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small simple cycle separators for 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved results on geometric hitting set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expected runtimes of a simple evolutionary algorithm for the multi-objective minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for the size of epsilon-nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5116530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted geometric set cover via quasi-uniform sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiently computing succinct trade-off curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the \(\epsilon\)-indicator subset selection / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/lipics.esa.2019.26 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2975342837 / rank
 
Normal rank
Property / title
 
On Geometric Set Cover for Orthants (English)
Property / title: On Geometric Set Cover for Orthants (English) / rank
 
Normal rank

Latest revision as of 10:23, 30 July 2024

scientific article; zbMATH DE number 7525463
Language Label Description Also known as
English
On Geometric Set Cover for Orthants
scientific article; zbMATH DE number 7525463

    Statements

    0 references
    0 references
    0 references
    0 references
    11 May 2022
    0 references
    set cover
    0 references
    parameterized complexity
    0 references
    algorithms
    0 references
    exponential time hypothesis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    On Geometric Set Cover for Orthants (English)
    0 references

    Identifiers