Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries

Computational Geometry: Theory and Applications - Netherlands
doi 10.1016/j.comgeo.2018.01.003
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Guarding Orthogonal Art Galleries With Sliding Cameras

Computational Geometry: Theory and Applications
ControlOptimizationGeometryComputational TheoryComputer Science ApplicationsComputational MathematicsMathematicsTopology
2017English

Guarding Orthogonal Art Galleries With Sliding Cameras

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
2011English

Lower Bounds for Measurable Chromatic Numbers

Geometric and Functional Analysis
GeometryAnalysisTopology
2009English

Cooperative Guards in Art Galleries

Dissertationes Mathematicae
Mathematics
2007English

Tight Bounds for Adopt-Commit Objects

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2013English

Tight Bounds for Parallel Randomized Load Balancing

2011English

Nearly Tight Bounds for Testing Function Isomorphism

2011English

Tight Worst-Case Bounds for Polynomial Loop Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy