3708 search results - page 104 / 742 » Approximating Betweenness Centrality |
101
click to vote
EOR
2007
15 years 18 days ago
2007
This paper investigates, for the first time in the literature, the approximation of minmax (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
107
Voted
MP
2006
15 years 18 days ago
2006
Mixed integer programming (MIP) formulations are typically tightened through the use of a separation algorithm and the addition of violated cuts. Using extended formulations involv...
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...
88
Voted
FUZZIEEE
2007
IEEE
15 years 7 months ago
2007
IEEE
— Reinforcement learning (RL) is a learning control paradigm that provides well-understood algorithms with good convergence and consistency properties. Unfortunately, these algor...
102
click to vote
PODC
2005
ACM
15 years 6 months ago
2005
ACM
In this paper, we initiate the study of the approximability of the facility location problem in a distributed setting. In particular, we explore a trade-off between the amount of...