144 search results - page 24 / 29 » Algorithms for the Hypergraph and the Minor Crossing Number ... |
STOC
2010
ACM
14 years 13 days ago
2010
ACM
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
STOC
1993
ACM
14 years 19 days ago
1993
ACM
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
IPPS
2008
IEEE
14 years 3 months ago
2008
IEEE
As high-end computer systems present users with rapidly increasing numbers of processors, possibly also incorporating attached co-processors, programmers are increasingly challeng...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
ALGORITHMICA
2004
13 years 8 months 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...