65 search results - page 1 / 13 » On approximating the maximum diameter ratio of graphs |
DM
2002
13 years 4 months ago
2002
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
—Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For sca...
ALGORITHMICA
2004
13 years 4 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
ALGORITHMICA
2004
13 years 4 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
AAIM
2008
Springer
13 years 11 months ago
2008
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of ...