Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129595195, #quickstatements; #temporary_batch_1726329260436
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Constrained hitting set problem with intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Structure preserving reductions among convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified greedy heuristic for the set covering problem with improved worst case bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / 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: Almost optimal set covers in finite VC-dimension / 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: Quasi-Polynomial Time Approximation Scheme for Weighted Geometric Set Cover on Pseudodisks and Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph problems with obligations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems as Hard as CNF-SAT / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129595195 / rank
 
Normal rank

Revision as of 17:17, 14 September 2024

scientific article; zbMATH DE number 7807470
Language Label Description Also known as
English
Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms
scientific article; zbMATH DE number 7807470

    Statements

    Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 February 2024
    0 references
    constrained geometric hitting set
    0 references
    computational complexity
    0 references
    approximation algorithms
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    set cover conjecture
    0 references

    Identifiers