Min-Cost Bipartite Perfect Matching with Delays (Q5002601): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
label / en | label / en | ||
Min-Cost Bipartite Perfect Matching with Delays | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5365114 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A dynamic model of barter exchange / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Matching and Thickness in Heterogeneous Dynamic Markets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Polylogarithmic-Competitive Algorithm for the <i>k</i> -Server Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms – ESA 2004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On randomization in on-line computation. / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2750046462 / rank | |||
Normal rank | |||
Property / title | |||
Min-Cost Bipartite Perfect Matching with Delays (English) | |||
Property / title: Min-Cost Bipartite Perfect Matching with Delays (English) / rank | |||
Normal rank |
Latest revision as of 08:45, 30 July 2024
scientific article; zbMATH DE number 7375806
Language | Label | Description | Also known as |
---|---|---|---|
English | Min-Cost Bipartite Perfect Matching with Delays |
scientific article; zbMATH DE number 7375806 |
Statements
28 July 2021
0 references
online algorithms with delayed service
0 references
bipartite matching
0 references
competitive analysis
0 references
Min-Cost Bipartite Perfect Matching with Delays (English)
0 references