65 search results - page 6 / 13 » On approximating the maximum diameter ratio of graphs |
109
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
144
click to vote
PROPERTYTESTING
2010
14 years 11 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
107
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
114
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
128
click to vote
WDAG
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...