534 search results - page 71 / 107 » Tight approximation algorithm for connectivity augmentation ... |
128
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
—The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to...
132
Voted
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
90
Voted
SOFSEM
2004
Springer
15 years 8 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
113
Voted
SODA
2010
ACM
16 years 19 hour ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
133
Voted
STOC
2009
ACM
16 years 3 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...