scientific article; zbMATH DE number 6783467

zbMath1377.90075MaRDI QIDQ5365115

No author found.

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133132

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Online algorithms; streaming algorithms (68W27)

Related Items (19)

Approximation algorithms for stochastic combinatorial optimization problems ⋮ The simulated greedy algorithm for several submodular matroid secretary problems ⋮ Secretary Markets with Local Information ⋮ A Framework for the Secretary Problem on the Intersection of Matroids ⋮ A note on the online interval scheduling secretary problem ⋮ Constant-competitiveness for random assignment matroid secretary without knowing the matroid ⋮ Generalized laminar matroids ⋮ Matroid-constrained vertex cover ⋮ Online interval scheduling with a bounded number of failures ⋮ The Submodular Secretary Problem Goes Linear ⋮ Laminar matroids ⋮ Secretary markets with local information ⋮ On variants of the matroid secretary problem ⋮ The Matroid Secretary Problem for Minor-Closed Classes and Random Matroids ⋮ A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem ⋮ Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) ⋮ Strong Algorithms for the Ordinal Matroid Secretary Problem ⋮ Unnamed Item ⋮ Worst case compromises in matroids with applications to the allocation of indivisible goods

This page was built for publication: