Serve or skip: the power of rejection in online bottleneck matching (Q346521): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6657324 / rank
 
Normal rank
Property / zbMATH Keywords
 
online algorithms
Property / zbMATH Keywords: online algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
bottleneck matching
Property / zbMATH Keywords: bottleneck matching / rank
 
Normal rank
Property / zbMATH Keywords
 
resource augmentation
Property / zbMATH Keywords: resource augmentation / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
matching
Property / zbMATH Keywords: matching / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1438989008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bottleneck matching / 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: An optimal deterministic algorithm for online \(b\)-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second-price ad auctions with binary bids and markets with good competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online matching on a line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two bottleneck optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of deferral / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining Assignments Online: Matching, Scheduling, and Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Weighted Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Transportation Problem / 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: The Power of Recourse for Online MST and TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: AdWords and generalized online matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal time-critical scheduling via resource augmentation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:59, 13 July 2024

scientific article
Language Label Description Also known as
English
Serve or skip: the power of rejection in online bottleneck matching
scientific article

    Statements

    Serve or skip: the power of rejection in online bottleneck matching (English)
    0 references
    0 references
    0 references
    29 November 2016
    0 references
    0 references
    online algorithms
    0 references
    bottleneck matching
    0 references
    resource augmentation
    0 references
    approximation algorithms
    0 references
    matching
    0 references
    0 references