Showing 2024Show all
2 papers · 1 filter
cs.DC2024
Local problems in trees across a wide range of distributed models
Anubhav Dhar, Eli Kujawa, Henrik Lievonen +4
The randomized online-LOCAL model captures a number of models of computing; it is at least as strong as all of these models: - the classical LOCAL model of distributed graph algori…
cs.CG2024
Efficient Exact Algorithms for Minimum Covering of Orthogonal Polygons with Squares
Anubhav Dhar, Subham Ghosh, Sudeshna Kolay
Let be an orthogonal polygon of vertices, without holes. The Orthogonal Polygon Covering with Squares (OPCS) problem takes as input such an orthogonal polygon with inte…