Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3098705741 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1009.5037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Knapsack Secretary Problem with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-parameter mechanism design and sequential posted pricing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating PageRank on graph streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading off space for passes in graph streaming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: IMPROVED APPROXIMATION GUARANTEES FOR WEIGHTED MATCHING IN THE SEMI-STREAMING MODEL * / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph problems in a semi-streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient On-Line Call Control Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positivity of second order linear recurrent sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4119222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Greedy Heuristic for Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Secretary Problems on Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monotone submodular maximization under matroid and knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196269 / rank
 
Normal rank

Latest revision as of 05:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
scientific article

    Statements

    Identifiers

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