Parameterized Distributed Algorithms
Published in DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) • Jan 1, 2019
NobleIDNI8P49W48R43S65
Authors:,,
Ran Ben Basat
Ken‐ichi Kawarabayashi
Gregory Schwartzman
Abstract
In this work, we initiate a thorough study of graph optimization problems parameterized by the output size in the distributed setting. In such a problem, an algorithm decides whether a solution of size bounded by k exists and if so, it finds one. We study fundamental problems, including Minimum Vert...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!