# Shortest Augmenting Paths for Online Matchings on Trees

Shortest Augmenting Paths for Online Matchings on Trees The shortest augmenting path (Sap) algorithm is one of the most classical approaches to the maximum matching and maximum flow problems, e.g., using it Edmonds and Karp (J. ACM 19(2), 248–264 1972) have shown the first strongly polynomial time algorithm for the maximum flow problem. Quite astonishingly, although it has been studied for many years already, this approach is far from being fully understood. This is exemplified by the online bipartite matching problem. In this problem a bipartite graph G = (W ⊎ B, E) is being revealed online, i.e., in each round one vertex from B with its incident edges arrives. After arrival of this vertex we augment the current matching by using shortest augmenting path. It was conjectured by Chaudhuri et al. (INFOCOM’09) that the total length of all augmenting paths found by Sap is O ( n log n ) $\mathcal {O}(n \log n)$ . However, no better bound than O ( n 2 ) $\mathcal {O}(n^{2})$ is known even for trees. In this paper we prove an O ( n log 2 n ) $\mathcal {O}(n \log ^{2}n)$ upper bound for the total length of augmenting paths for trees. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Theory of Computing Systems Springer Journals

# Shortest Augmenting Paths for Online Matchings on Trees

, Volume 62 (2) – Jan 24, 2018
12 pages

/lp/springer_journal/shortest-augmenting-paths-for-online-matchings-on-trees-bqo02Hvtri
Publisher
Springer US
Subject
Computer Science; Theory of Computation
ISSN
1432-4350
eISSN
1433-0490
D.O.I.
10.1007/s00224-017-9838-x
Publisher site
See Article on Publisher Site

### Abstract

The shortest augmenting path (Sap) algorithm is one of the most classical approaches to the maximum matching and maximum flow problems, e.g., using it Edmonds and Karp (J. ACM 19(2), 248–264 1972) have shown the first strongly polynomial time algorithm for the maximum flow problem. Quite astonishingly, although it has been studied for many years already, this approach is far from being fully understood. This is exemplified by the online bipartite matching problem. In this problem a bipartite graph G = (W ⊎ B, E) is being revealed online, i.e., in each round one vertex from B with its incident edges arrives. After arrival of this vertex we augment the current matching by using shortest augmenting path. It was conjectured by Chaudhuri et al. (INFOCOM’09) that the total length of all augmenting paths found by Sap is O ( n log n ) $\mathcal {O}(n \log n)$ . However, no better bound than O ( n 2 ) $\mathcal {O}(n^{2})$ is known even for trees. In this paper we prove an O ( n log 2 n ) $\mathcal {O}(n \log ^{2}n)$ upper bound for the total length of augmenting paths for trees.

### Journal

Theory of Computing SystemsSpringer Journals

Published: Jan 24, 2018

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations