Local search algorithms for the maximum carpool matching problem

The Maximum Carpool Matching problem is a star packing problem in directed graphs. Formally, given a directed graph G = (V,A), a capacity function c : V → N, and a weight function w : A→R⁺, a carpool matching is a subset of arcs, M ⊆A, such that every v ϵ V satisfies: (i) dⁱⁿ_M (v) · dout M (v) = 0, (ii) dⁱⁿ_M (v) ≤ c(v), and (iii) d^out _M (v) ≤ 1. A vertex v for which dout M (v) = 1 is a passenger, and a vertex for which d^out _M(v) = 0 is a driver who has dⁱⁿ_M (v) passengers. In the Maximum Carpool Matching problem the goal is to find a carpool matching M of maximum total weight. The problem arises when designing an online carpool service, such as Zimride [4], which tries to connect between users based on a similarity function. The problem is known to be NP-hard, even in the unweighted and uncapacitated case. The Maximum Group Carpool Matching problem, is an extension of Maximum Carpool Matching where each vertex represents an unsplittable group of passengers. Formally, each vertex u ϵ V has a size s(u) ϵ N, and the constraint dⁱⁿ_M(v) ≤ c(v) is replaced with ∑u:(u,v)2M ^s(u) ≤c(v). We show that Maximum Carpool Matching can be formulated as an unconstrained submodular maximization problem, thus it admits a 1/2 -Approximation algorithm. We show that the same formulation does not work for Maximum Group Carpool Matching, nevertheless, we present a local search ( 1/2 -ϵ)-Approximation algorithm for Maximum Group Carpool Matching. For the unweighted variant of both problems when the maximum possible capacity, c_max, is bounded by a constant, we provide a local search ( 1/2 + 1/2 c_max - ϵ)-Approximation algorithm. We also show that the problem is APX-hard, even if the maximum degree and c_max are at most 3.