Pages that link to "Item:Q5916084"
From MaRDI portal
The following pages link to Deterministic min-cost matching with delays (Q5916084):
Displaying 14 items.
- Minimum cost perfect matching with delays for two sources (Q1628601) (← links)
- A primal-dual online deterministic algorithm for matching with delays (Q1757757) (← links)
- Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays (Q4575807) (← links)
- Min-Cost Bipartite Perfect Matching with Delays (Q5002601) (← links)
- Competitive analysis for two variants of online metric matching problem (Q5025166) (← links)
- Caching with Time Windows and Delays (Q5092509) (← links)
- Technical Note—Online Hypergraph Matching with Delays (Q5106363) (← links)
- Deterministic min-cost matching with delays (Q5916084) (← links)
- (Q5918854) (redirect page) (← links)
- Permutation Strikes Back: The Power of Recourse in Online Metric Matching (Q6084396) (← links)
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays (Q6591637) (← links)
- Randomized algorithm for MPMD on two sources (Q6609154) (← links)
- Capacity-insensitive algorithms for online facility assignment problems on a line (Q6637060) (← links)
- Deterministic primal-dual algorithms for online \(k\)-way matching with delays (Q6658298) (← links)