Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Visibility testing and counting for uncertain segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved analysis of Goemans and Williamson's LP-relaxation for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the visibility graph of points within a polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for one-step planar compliant motion planning with uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Region-based Approximation Algorithms for Visibility between Imprecise Locations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the shortest watchman route in a simple polygon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity graphs of uncertainty regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility and intersection problems in plane geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of planar compliant motion planning under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibility Algorithms in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special planar satisfiability problem and a consequence of its NP- completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4032119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Watchman Routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard tiling problems with simple tiles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3799261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank

Latest revision as of 18:28, 1 August 2024

scientific article; zbMATH DE number 7712535
Language Label Description Also known as
English
Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles
scientific article; zbMATH DE number 7712535

    Statements

    Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (English)
    0 references
    0 references
    0 references
    14 July 2023
    0 references
    0 references
    SAT
    0 references
    visibility
    0 references
    uncertain obstacles
    0 references
    0 references
    0 references
    0 references
    0 references