ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE (Q4581438): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Mikhail Yu. Khachay / rank
Normal rank
 
Property / author
 
Property / author: Mikhail Yu. Khachay / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AdaBoost.MH / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2560035725 / 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: Polynomial-time approximation schemes for packing and piercing fat objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity / 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: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: Committee polyhedral separability: complexity and polynomial approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering, Hitting, Piercing and Packing Rectangles Intersecting an Inclined Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2893108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:12, 16 July 2024

scientific article; zbMATH DE number 6920158
Language Label Description Also known as
English
ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE
scientific article; zbMATH DE number 6920158

    Statements

    ON PARAMETERIZED COMPLEXITY OF HITTING SET PROBLEM FOR AXIS–PARALLEL SQUARES INSTERSECTING A STRAIGHT LINE (English)
    0 references
    0 references
    0 references
    17 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    hitting set problem
    0 references
    dynamic programming
    0 references
    computational geometry
    0 references
    parameterized complexity
    0 references
    0 references