The maximum cardinality and maximum weight matching problems can be solved in Õ (m√
n) time, a bound that has resisted improvement despite decades of research.(Here m and n …

We give algorithms for geometric graph problems in the modern parallel models such as
MapReduce. For example, for the Minimum Spanning Tree (MST) problem over a set of …

The increasing popularity of social networks has inspired recent research to explore social
graphs for marketing and data mining. As social networks often contain sensitive information …

In this paper, we propose a general framework for graph matching which is suitable for
different problems of pattern recognition. The pattern representation we assume is at the …

Location problems occurring in urban or regional settings may involve many tens of
thousands of “demand points,” usually individual private residences. In modeling such …

We provide the first sub-linear sketching algorithm for estimating the planar Earth-Mover
Distance with a constant approximation. For sets living in the two-dimensional grid [¿] 2, we …

Given two point sets A and B in ℝ d of size n each, for some constant dimension d≥ 1, and a
parameter ε> 0, we present a deterministic algorithm that computes, in n·(ε− 1 log n) O (d) …

Let G= G (A∪ B, A× B), with| A|=| B|= n, be a weighted bipartite graph, and let d (⊙,⊙) be
the cost function on the edges. Let w (M) denote the weight of a matching in G, and M* a …

In the geometric transportation problem, we are given a collection of points $ P $ in $ d $-
dimensional Euclidean space, and each point is given a supply of $\mu (p) $ units of mass …

Abstract For A, B⊂ ℝ d,| A|+| B|= n, let a∊ A have a demand da∊ ℤ+ and b∊ B have a supply
sb∊ ℤ+, σ a∊ A da= σ b∊ B sb= U and let d (·,·) be a distance function. Suppose the …