# Online Maximum Matching with Recourse

@inproceedings{Angelopoulos2018OnlineMM, title={Online Maximum Matching with Recourse}, author={Spyros Angelopoulos and Christoph D{\"u}rr and Shendan Jin}, booktitle={MFCS}, year={2018} }

We study the online maximum matching problem with recourse in a model in which the edges are associated with a known recourse parameter $k$. An online algorithm for this problem has to maintain a valid matching while edges of the underlying graph are presented one after the other. At any moment the algorithm can decide to include an edge into the matching or to exclude it, under the restriction that at most $k$ actions per edge take place, where $k$ is typically a small constant. This problem… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

3

Twitter Mentions

#### Citations

##### Publications citing this paper.

SHOWING 1-2 OF 2 CITATIONS

## Online Graph Matching Problems with a Worst-Case Reassignment Budget

VIEW 2 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 18 REFERENCES