Packing returning secretaries

DOI10.1002/NET.22000MaRDI QIDQ6087124zbMATH OpenOpenAlexFDO

Authors Martin Hoefer, Lisa Wilhelmi

Publication date 11 December 2023

Published in Networks (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

coupon collector problemmatchingmatroidsonline algorithmpacking problemsecretary problem

Mathematics Subject Classification ID

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

Recommendations

• Packing returning secretaries
• The returning secretary
• scientific article; zbMATH DE number 874532
• The Secretary's Packet Problem
• Knapsack secretary through boosting
• Packing a trunk
• The multi-returning secretary problem
• The pursuit of perfect packing
• scientific article; zbMATH DE number 1516792

Cites work

• A Knapsack Secretary Problem with Applications
• A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
• A survey of the coupon collector's problem with random sample sizes
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions
• Beyond matroids: secretary problem and prophet inequality with general constraints
• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Combinatorial secretary problems with ordinal information
• Matroids, secretary problems, and online mechanisms
• On maximizing welfare when utility functions are subadditive
• Online independent set beyond the worst-case: secretaries, prophets, and periods
• Packing returning secretaries
• Primal beats dual on online packing LPs in the random-order model
• Secretary markets with local information
• Strong algorithms for the ordinal matroid secretary problem
• Submodular secretary problems: cardinality, matching, and linear constraints
• The coupon-collector problem revisited — a survey of engineering problems and computational methods
• The returning secretary
• The submodular secretary problem goes linear
• The Temp Secretary Problem
• Who solved the secretary problem

Cited in

(1)

• Packing returning secretaries

This page was built for publication: Packing returning secretaries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087124)