Packing returning secretaries

DOI10.1002/net.22000OpenAlexW3110398686MaRDI QIDQ6087124

Lisa Wilhelmi, Martin Hoefer

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22000

zbMATH Keywords

matchingmatroidspacking problemonline algorithmsecretary problemcoupon collector problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Who solved the secretary problem
• Secretary markets with local information
• A survey of the coupon collector's problem with random sample sizes
• Geometry of Online Packing Linear Programs
• An Optimal Online Algorithm for Weighted Bipartite Matching and Extensions to Combinatorial Auctions
• The Returning Secretary
• The coupon-collector problem revisited — a survey of engineering problems and computational methods
• The Temp Secretary Problem
• A Knapsack Secretary Problem with Applications
• Primal Beats Dual on Online Packing LPs in the Random-Order Model
• The Submodular Secretary Problem Goes Linear
• Submodular Secretary Problems: Cardinality, Matching, and Linear Constraints
• Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
• On Maximizing Welfare When Utility Functions Are Subadditive
• A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• Beyond matroids: secretary problem and prophet inequality with general constraints

This page was built for publication: Packing returning secretaries