The parameterized complexity of stabbing rectangles (Q2428672): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-010-9471-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032054765 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57359642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Physical Mapping and the consecutive ones property for sparse matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: SEPARATING POINTS BY AXIS-PARALLEL LINES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds for certain parameterized NP-hard problems / 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: Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of multiple-interval graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval routing schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and lower bounds for stabbing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for hitting objects with straight lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal segment stabbing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Rectangle Stabbing and Interval Stabbing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering things with things / 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: Station Location - Complexity and Approximation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of locating linear facilities in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON PIERCING SETS OF AXIS-PARALLEL RECTANGLES AND RINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity of regular graphs and blocks of consecutive ones in symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant approximation algorithms for rectangle stabbing and related problems / rank
 
Normal rank

Latest revision as of 03:37, 5 July 2024

scientific article
Language Label Description Also known as
English
The parameterized complexity of stabbing rectangles
scientific article

    Statements

    The parameterized complexity of stabbing rectangles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2012
    0 references
    0 references
    parameterized complexity
    0 references
    fixed-parameter algorithms
    0 references
    geometric covering problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references