1 citations · 1 across the 1 of their papers we have counts for
4 papers
Paying for Fractional Error: Tight Constant-Round Approximation of Covering Problems with Short Broadcasts
Saeed Amiri, Sebastian Siebertz, Wojciech Wawrzyniak
We present a general framework for deterministic constant-round approximation of covering problems in sparse networks in the broadcast CONGEST model, where every vertex broadcasts…
FireNav: Decision-Oriented Reconstruction Evidence Routing for Vision-Language Navigation in Indoor Fire Environments
Hongbo Ding, Xiang Chen, Jiangxin Dong +1
In real-world indoor fire environments, visual degradation severely impairs instruction grounding, waypoint prediction, and long-horizon exploration in vision-language navigation (…
Near-Optimal Distributed Domination in Planar Graphs
Wojciech Wawrzyniak
We give a deterministic -approximation for minimum dominating set on planar graphs in a constant number of rounds of the LOCAL model, for every . Th…
A local constant-factor approximation algorithm for MDS problem in anonymous network
Wojciech Wawrzyniak
In research on distributed local algorithms it is commonly assumed that each vertex has a unique identifier in the entire graph. However, it turns out that in case of certain class…