Distributed approximation algorithms for graph problems
Published in FreiDok plus (Universitätsbibliothek Freiburg) • Apr 23, 2026
Authors:
Salwa Faour
Abstract
In this thesis, we study two classical optimization problems in graph algorithms, namely the Minimum Weight Vertex Cover (MWVC) problem and the Maximum Weight Independent Set (MWIS) problem. In the centralized setting, both problems are NP-hard on general graphs, and remain NP-hard even on restricte...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!