Fast primal-dual distributed algorithms for scheduling and matching problems
From MaRDI portal
Publication:2377143
DOI10.1007/s00446-010-0100-xzbMath1267.68312OpenAlexW2000278241MaRDI QIDQ2377143
Alessandro Panconesi, Mauro Sozio
Publication date: 28 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-010-0100-x
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Distributed algorithms (68W15)
Related Items (7)
Improved algorithms for resource allocation under varying capacity ⋮ Fast primal-dual distributed algorithms for scheduling and matching problems ⋮ Improved deterministic distributed matching via rounding ⋮ Distributed approximation of cellular coverage ⋮ Distributed algorithms for covering, packing and maximum weighted matching ⋮ Best of two local models: centralized local and distributed local algorithms ⋮ Set cover problems with small neighborhood covers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed approximation of cellular coverage
- Distributed approximation of capacitated dominating sets
- Local approximability of max-min and min-max linear programs
- Scheduling jobs with fixed start and end times
- Approximating matchings in parallel
- Fast primal-dual distributed algorithms for scheduling and matching problems
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling
- On the Distributed Complexity of Computing Maximal Matchings
- A log-star distributed maximal independent set algorithm for growth-bounded graphs
- Distributed order scheduling and its application to multi-core dram controllers
- Improved Distributed Approximate Matching
- Distributed Approximate Matching
- The price of being near-sighted
- A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover
- Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS
- Approximation algorithms for dynamic storage allocation
- The stochastic single resource service-provision problem
- On the Complexity of Distributed Network Decomposition
- Distributed and parallel algorithms for weighted vertex cover and other covering problems
- Return of the primal-dual
- On the locality of bounded growth
- Facility location
- A parallel approximation algorithm for positive linear programming
- Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
- Distributed Weighted Matching
- A unified approach to approximating resource allocation and scheduling
- Concentration of Measure for the Analysis of Randomized Algorithms
- Constant-time distributed dominating set approximation
This page was built for publication: Fast primal-dual distributed algorithms for scheduling and matching problems
