9532 search results - page 47 / 1907 » Logic, Graphs, and Algorithms |
83
Voted
ICALP
2003
Springer
15 years 4 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
APPROX
2010
Springer
15 years 19 days ago
2010
Springer
We present a simple factor 6 algorithm for approximating the optimal multiplicative distortion of embedding (unweighted) graph metrics into tree metrics (thus improving and simplif...
TIME
2009
IEEE
15 years 5 months ago
2009
IEEE
FSKD
2005
Springer
15 years 4 months ago
2005
Springer
FCCM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...