Competitive Weighted Matching in Transversal Matroids-Reference-Cited by-同舟云学术

Competitive Weighted Matching in Transversal Matroids

Published:2010-10-21 Issue:1-2 Volume:62 Page:333-348
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Dimitrov Nedialko B.,Plaxton C. Greg

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00453-010-9457-2.pdf

Reference12 articles.

1. Babaioff, M., Immorlica, N., Kleinberg, R.: Matroids, secretary problems, and online mechanisms. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2007, pp. 434–443 (2008)

2. Birnbaum, B., Mathieu, C.: On-line bipartite matching made simple. SIGACT News 39, 80–87 (2008)

3. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

4. Ferguson, T.: Who solved the secretary problem? Stat. Sci. 4, 282–289 (1989)

5. Freeman, P.R.: The secretary problem and its extensions: a review. Int. Stat. Rev. 51, 189–206 (1983)

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Secretary and online matching problems with machine learned advice;Discrete Optimization;2023-05

2. Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid;Integer Programming and Combinatorial Optimization;2023

3. General Graphs are Easier than Bipartite Graphs: Tight Bounds for Secretary Matching;Proceedings of the 23rd ACM Conference on Economics and Computation;2022-07-12

4. A Framework for the Secretary Problem on the Intersection of Matroids;SIAM Journal on Computing;2022-06

5. Strong Algorithms for the Ordinal Matroid Secretary Problem;Mathematics of Operations Research;2021-02-23