3708 search results - page 124 / 742 » Approximating Betweenness Centrality |
137
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
207
click to vote
SIGMOD
2008
ACM
16 years 26 days ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
120
click to vote
ICTAI
2008
IEEE
15 years 7 months ago
2008
IEEE
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
122
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
Let G = (V, E) be an weighted undirected graph on n vertices and m edges, and let dG be its shortest path metric. We present two simple deterministic algorithms for approximating ...
120
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...