# Combinatorial Algorithms for Server Allocation Problem

## Files

## TR Number

## Date

## Authors

## Journal Title

## Journal ISSN

## Volume Title

## Publisher

## Abstract

Motivated by problems in logistics, image recognition, and statistics, we consider the server allocation problem. In this problem, we are given

We present new algorithms for the Euclidean bipartite matching problem, showing improvements over existing algorithms. In particular, for two point sets

item A faster algorithm that computes an

end{itemize}