TY - GEN

T1 - Computing fair and bottleneck matchings in geometric graphs

AU - Efrat, Alon

AU - Katz, Matthew J.

N1 - Publisher Copyright:
© 1996 Springer-Verlag. All rights reserved.

PY - 1996/1/1

Y1 - 1996/1/1

N2 - Let A and B be two sets of n points in the plane, and let M be a (one-to-one) matching between .4 and B. Let rain(M), max(M), and Σ(M) denote the length of the shortest edge, the length of the longest edge, and the sum of the lengths of the edges of M respectively. The uniform matching problem (also called the balanced assignment problem, or the fair matching problem) is to find M* U, a matching that minimizes max(M) - rain(M). A minimum deviation matching M* D is a matching that (1/n)Σ(M) – min(M). We present algorithms for computing M* U and M* D in roughly O(n10/3) time. These algorithms are more efficient than the previous O(n4)-time algorithms of Martello and Toth [19] and Gupta and Punnen [11], who studied these problems for general bipartite graphs. We also consider the (non-bipartite version of the) bottleneck matching problem in higher dimensions. We extend the planar results of Chang et al. [4] and Su and Chang [22], and show that given a set A of 2n points in d-space, it is possible to compute a bottleneck matching of A in roughly O(n3/2) time, for d ≤ 6, and in subquadratic time, for d > 6.

AB - Let A and B be two sets of n points in the plane, and let M be a (one-to-one) matching between .4 and B. Let rain(M), max(M), and Σ(M) denote the length of the shortest edge, the length of the longest edge, and the sum of the lengths of the edges of M respectively. The uniform matching problem (also called the balanced assignment problem, or the fair matching problem) is to find M* U, a matching that minimizes max(M) - rain(M). A minimum deviation matching M* D is a matching that (1/n)Σ(M) – min(M). We present algorithms for computing M* U and M* D in roughly O(n10/3) time. These algorithms are more efficient than the previous O(n4)-time algorithms of Martello and Toth [19] and Gupta and Punnen [11], who studied these problems for general bipartite graphs. We also consider the (non-bipartite version of the) bottleneck matching problem in higher dimensions. We extend the planar results of Chang et al. [4] and Su and Chang [22], and show that given a set A of 2n points in d-space, it is possible to compute a bottleneck matching of A in roughly O(n3/2) time, for d ≤ 6, and in subquadratic time, for d > 6.

UR - http://www.scopus.com/inward/record.url?scp=84990228138&partnerID=8YFLogxK

U2 - 10.1007/bfb0009487

DO - 10.1007/bfb0009487

M3 - Conference contribution

AN - SCOPUS:84990228138

SN - 3540620486

SN - 9783540620488

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 116

EP - 125

BT - Algorithms and Computation - 7th International Symposium, ISAAC 1996, Proceedings

A2 - Asano, Tetsuo

A2 - Igarashi, Yoshihide

A2 - Nagamochi, Hiroshi

A2 - Miyano, Satoru

A2 - Suri, Subhash

PB - Springer Verlag

T2 - 7th International Symposium on Algorithms and Computation, ISAAC 1996

Y2 - 16 December 1996 through 18 December 1996

ER -