Lower bounds for local approximation
Work
Year: 2012
Type: article
Abstract: In the study of deterministic distributed algorithms it is commonly assumed that each node has a unique O(log n)-bit identifier. We prove that for a general class of graph problems, local algorithms (... more
Authors Mika Göös, Juho Hirvonen, Jukka Suomela
Institution University of Helsinki
Cites: 44
Cited by: 17
Related to: 10
FWCI: 3.874
Citation percentile (by year/subfield): 80.44
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green