A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-012-9676-9 / rank
Normal rank
 
Property / author
 
Property / author: Nikhil Bansal / rank
Normal rank
 
Property / author
 
Property / author: Joseph (Seffi) Naor / rank
Normal rank
 
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/s00453-012-9676-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036268824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Transportation Problem: On the Exponential Boost of One Extra Server / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online matching on a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Weighted Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal deterministic algorithm for online \(b\)-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line algorithms for weighted bipartite matching and stable marriages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the <i>k</i> -server conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive algorithms for server problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: AdWords and generalized online matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized online algorithms for minimum metric bipartite matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic matching for graphs satisfying the triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Greedy Heuristic for Complete Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Travelling Salesman Problem and Minimum Matching in the Unit Square / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-012-9676-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:41, 9 December 2024

scientific article
Language Label Description Also known as
English
A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching
scientific article

    Statements

    A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    online algorithm
    0 references
    competitive analysis
    0 references
    metric matching
    0 references
    randomized algorithm
    0 references

    Identifiers