3874 search results - page 157 / 775 » Approximation Algorithms for k-hurdle Problems |
137
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We consider a classic multidimensional generalization of the bin packing problem, namely, packing d-dimensional rectangles into the minimum number of unit cubes. Our two results a...
121
click to vote
SODA
1998
ACM
15 years 3 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
118
click to vote
STOC
2001
ACM
16 years 2 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
150
Voted
FSTTCS
2003
Springer
15 years 7 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
133
click to vote
STOC
2010
ACM
15 years 6 months ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...