arXiv (All)
open access
Deterministic online matching under short augmenting paths and restricted vertex reassignments
We study deterministic online bipartite matching with local recourse. Online vertices arrive one by one and reveal edges to a fixed offline set. After each arrival, the algorithm maintains a matching and may update it only by an augmenting path of length $1$ or $3$ starting at the new vertex. In the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- RetractorDB: A Deterministic Edge Signal Processing Engine Based on Rational Beatty Sequences and Fraenkel's Partition#353132
- Toward an Internet standard scheme for subnetting#211338
- Distributed Algorithms#3468
- Seamless Bidirectional Forwarding Detection (S-BFD) Use Cases#166236
- Generic Application of Bidirectional Forwarding Detection (BFD)#501256
Record · ID 1013156
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive