3475 search results - page 67 / 695 » Backbones in Optimization and Approximation |
135
click to vote
JSAC
2007
15 years 2 months ago
2007
Abstract— In this paper we consider the problem of provisioning spare capacity in two-layer backbone networks using shared backup path protection. First, two spare capacity alloc...
106
Voted
ICPR
2008
IEEE
16 years 3 months ago
2008
IEEE
Clustering time-series data poses problems, which do not exist in traditional clustering in Euclidean space. Specifically, cluster prototype needs to be calculated, where common s...
124
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
124
click to vote
SODA
2010
ACM
15 years 12 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
130
click to vote
COCOON
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...