ALGORITHMICA
2004
14 years 14 days ago
2004
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with costs {ce} on the edges, a set of facilities F V , and a set of clients D V . Facility ...
ALGORITHMICA
2004
14 years 14 days ago
2004
We study the Hausdorff Voronoi diagram of point clusters in the plane, a generalization of Voronoi diagrams based on the Hausdorff distance function. We derive a tight combinatori...
ALGORITHMICA
2004
14 years 14 days ago
2004
ALGORITHMICA
2004
14 years 14 days ago
2004
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
ALGORITHMICA
2004
14 years 14 days ago
2004
ALGORITHMICA
2004
14 years 14 days ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
ALGORITHMICA
2004
14 years 14 days ago
2004
ALGORITHMICA
2004
14 years 14 days ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
ALGORITHMICA
2004
14 years 14 days ago
2004
We consider the d-dimensional cube packing problem (d-CPP): given a list L of d-dimensional cubes and (an unlimited quantity of) d-dimensional unit-capacity cubes, called bins, fi...
ALGORITHMICA
2004
14 years 14 days ago
2004