Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists

DOI10.3390/a6040824zbMath1461.68153DBLPjournals/algorithms/GeorgiadisP13OpenAlexW2005066278WikidataQ57583912 ScholiaQ57583912MaRDI QIDQ1736596

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

zbMATH Keywords

matchingadaptive algorithmsdistributed algorithmsoverlay networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (4)

Editorial: Special issue on matching under preferences ⋮ Approximation algorithms in combinatorial scientific computing ⋮ Efficient Approximation Algorithms for Weighted $b$-Matching ⋮ Unnamed Item

Uses Software

• PeerSim

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards a scalable and robust DHT
• Matching theory
• Hard variants of stable marriage.
• The stable fixtures problem -- a many-to-many extension of stable roommates
• On a generalization of the stable roommates problem
• Emergence of Scaling in Random Networks
• Improved Distributed Approximate Matching
• NP-complete stable matching problems
• The price of being near-sighted
• Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• Paths, Trees, and Flowers
• Distributed approximate matching
• Distributed Weighted Matching
• College Admissions and the Stability of Marriage

This page was built for publication: Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists