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

zbMATH Keywords

matchingdistributed algorithmsadaptive algorithmsoverlay networks

Mathematics Subject Classification ID

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)

Recommendations

• Stable Matching with Evolving Preferences
• Distributed stable matching with similar preference lists
• Distributed approximate matching
• Distributed near-optimal matching
• Fast distributed almost stable matchings

Cites Work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 1304326 (Why is no real title available?)
• scientific article; zbMATH DE number 1405659 (Why is no real title available?)
• A distributed polylogarithmic time algorithm for self-stabilizing skip graphs
• College Admissions and the Stability of Marriage
• Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
• Distributed Weighted Matching
• Distributed approximate matching
• Emergence of Scaling in Random Networks
• Hard variants of stable marriage.
• Improved Distributed Approximate Matching
• Matching theory
• NP-complete stable matching problems
• On a generalization of the stable roommates problem
• Paths, Trees, and Flowers
• The price of being near-sighted
• The stable fixtures problem -- a many-to-many extension of stable roommates
• Towards a scalable and robust DHT

Cited In (4)

• Approximation algorithms in combinatorial scientific computing
• Editorial: Special issue on matching under preferences
• Aggregative coarsening for multilevel hypergraph partitioning
• Efficient approximation algorithms for weighted \(b\)-matching

Uses Software

• PeerSim

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)