Approximation algorithms for the partial assignment problem (Q2197546): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Online Lower Bounds via Duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation-Robust Analysis of Single Item Auction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple mechanisms for subadditive buyers via duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pricing for Online Resource Allocation: Intervals and Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offline and online algorithms for single-minded selling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for combinatorial auctions with submodular bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Submodular Welfare Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Revenue Gaps among Simple Mechanisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online pricing for bundles of multiple items / rank
 
Normal rank

Latest revision as of 09:42, 23 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for the partial assignment problem
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references