Fast primal-dual distributed algorithms for scheduling and matching problems (Q2377143): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-010-0100-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000278241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with fixed start and end times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to approximating resource allocation and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Throughput of Multiple Machines in Real-Time Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: PARALLEL ALGORITHMS FOR FINDING MAXIMAL k-DEPENDENT SETS AND MAXIMAL f-MATCHINGS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of Measure for the Analysis of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stochastic single resource service-provision problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating matchings in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local approximability of max-min and min-max linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for dynamic storage allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primal-Dual Bicriteria Distributed Algorithm for Capacitated Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Distributed Complexity of Computing Maximal Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234153 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed and parallel algorithms for weighted vertex cover and other covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation of capacitated dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the locality of bounded growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of being near-sighted / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-time distributed dominating set approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Approximate Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Approximate Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel approximation algorithm for positive linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed order scheduling and its application to multi-core dram controllers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast primal-dual distributed algorithms for scheduling and matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Distributed Network Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Return of the primal-dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation of cellular coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A log-star distributed maximal independent set algorithm for growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for 2-Stage Stochastic Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Weighted Matching / rank
 
Normal rank

Latest revision as of 13:49, 6 July 2024

scientific article
Language Label Description Also known as
English
Fast primal-dual distributed algorithms for scheduling and matching problems
scientific article

    Statements

    Fast primal-dual distributed algorithms for scheduling and matching problems (English)
    0 references
    0 references
    0 references
    28 June 2013
    0 references
    primal-dual schema
    0 references
    matching
    0 references
    scheduling
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers