676 search results - page 70 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
166
click to vote
COMBINATORICA
2007
15 years 5 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
150
click to vote
FOCS
2010
IEEE
15 years 4 months ago
2010
IEEE
We study differential privacy in a distributed setting where two parties would like to perform analysis of their joint data while preserving privacy for both datasets. Our results ...
199
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
170
click to vote
HEURISTICS
2006
15 years 6 months ago
2006
Multiobjective optimization deals with problems involving multiple measures of performance that should be optimized simultaneously. In this paper we extend bucket elimination (BE),...
183
click to vote
TIT
1998
15 years 5 months ago
1998
Abstract— The paper deals with estimating transfer functions of stable linear time-invariant systems under stochastic assumptions. We adopt a nonparametric minimax approach for m...