119
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
In this paper, we present a polynomial-time algorithm that approximates sufficiently high-value Max 2-CSPs on sufficiently dense graphs to within Nε approximation ratio for any c...
114
click to vote
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion and repacking of previously packed items is allowed. The goal is, of course, ...
122
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
We study the effect that the amount of correlation in a bipartite distribution has on the communication complexity of a problem under that distribution. We introduce a new family...
147
click to vote
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
The average distance from a node to all other nodes in a graph, or from a query point in a metric space to a set of points, is a fundamental quantity in data analysis. The inverse...
128
Voted
APPROX
2015
Springer
9 years 11 months ago
2015
Springer
Kernel methods are an extremely popular set of techniques used for many important machine learning and data analysis applications. In addition to having good practical performance...