Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
DOI10.3390/A6040824zbMATH Open1461.68153DBLPjournals/algorithms/GeorgiadisP13OpenAlexW2005066278WikidataQ57583912 ScholiaQ57583912MaRDI QIDQ1736596FDOQ1736596
Authors: Giorgos Georgiadis, Marina Papatriantafilou
Publication date: 26 March 2019
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a6040824
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distributed algorithms (68W15)
Cites Work
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Matching theory
- Paths, Trees, and Flowers
- NP-complete stable matching problems
- Title not available (Why is that?)
- College Admissions and the Stability of Marriage
- Title not available (Why is that?)
- Title not available (Why is that?)
- A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
- Improved Distributed Approximate Matching
- Hard variants of stable marriage.
- The price of being near-sighted
- Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
- Distributed approximate matching
- Distributed Weighted Matching
- On a generalization of the stable roommates problem
- Towards a scalable and robust DHT
- The stable fixtures problem -- a many-to-many extension of stable roommates
Cited In (4)
Uses Software
This page was built for publication: Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736596)