Survey of local algorithms
J Suomela - ACM Computing Surveys (CSUR), 2013 - dl.acm.org
A local algorithm is a distributed algorithm that runs in constant time, independently of the
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …
size of the network. Being highly scalable and fault tolerant, such algorithms are ideal in the …
Various properties of various ultrafilters, various graph width parameters, and various connectivity systems (with survey)
T Fujita - arxiv preprint arxiv:2408.02299, 2024 - arxiv.org
This paper investigates ultrafilters in the context of connectivity systems, defined as pairs
$(X, f) $ where $ X $ is a finite set and $ f $ is a symmetric submodular function. Ultrafilters …
$(X, f) $ where $ X $ is a finite set and $ f $ is a symmetric submodular function. Ultrafilters …
[HTML][HTML] A survey of selected recent results on total domination in graphs
MA Henning - Discrete Mathematics, 2009 - Elsevier
A survey of selected recent results on total domination in graphs - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …
[PDF][PDF] Tight approximation algorithms for maximum general assignment problems
A separable assignment problem (Ë È) is defined by a set of bins and a set of items to pack
in each bin; a value,, for assigning item to bin; and a separate packing constraint for each …
in each bin; a value,, for assigning item to bin; and a separate packing constraint for each …
Local computation: Lower and upper bounds
The question of what can be computed, and how efficiently, is at the core of computer
science. Not surprisingly, in distributed systems and networking research, an equally …
science. Not surprisingly, in distributed systems and networking research, an equally …
Polylogarithmic inapproximability
We provide the first hardness result of a polylogarithmic approximation ratio for a natural NP-
hard optimization problem. We show that for every fixed ε> 0, the GROUP-STEINER-TREE …
hard optimization problem. We show that for every fixed ε> 0, the GROUP-STEINER-TREE …
Texts in Theoretical Computer Science An EATCS Series
A Board, GAMBCS Calude, ACDHJ Hartmanis… - 2005 - Springer
This book is an accessible introduction to complexity theory and cryptology, two closely
related areas in theoretical computer science. Based on courses taught at Heinrich-Heine …
related areas in theoretical computer science. Based on courses taught at Heinrich-Heine …
Approximation algorithms for allocation problems: Improving the factor of 1-1/e
U Feige, J Vondrák - 2006 47th Annual IEEE Symposium on …, 2006 - ieeexplore.ieee.org
Combinatorial allocation problems require allocating items to players in a way that
maximizes the total utility. Two such problems received attention recently, and were …
maximizes the total utility. Two such problems received attention recently, and were …
[BOOK][B] Connected dominating set: theory and applications
The connected dominating set (CDS) has been a classic subject studied in graph theory
since 1975. It has been discovered in recent years that CDS has important applications in …
since 1975. It has been discovered in recent years that CDS has important applications in …
Approximating min sum set cover
The input to the min sum set cover problem is a collection of n sets that jointly cover m
elements. The output is a linear order on the sets, namely, in every time step from 1 to n …
elements. The output is a linear order on the sets, namely, in every time step from 1 to n …