Sciweavers

41 search results - page 1 / 9
» Matroids with nine elements
Sort
View
JCT
2008
68views more  JCT 2008»
13 years 4 months ago
Matroids with nine elements
Dillon Mayhew, Gordon F. Royle
SODA
2012
ACM
249views Algorithms» more  SODA 2012»
11 years 7 months ago
Improved competitive ratio for the matroid secretary problem
The Matroid Secretary Problem, introduced by Babaioff et al. (2007), is a generalization of the Classical Secretary Problem. In this problem, elements from a matroid are presente...
Sourav Chakraborty, Oded Lachish
SODA
2007
ACM
99views Algorithms» more  SODA 2007»
13 years 6 months ago
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the “matroid secretary problem”. In this problem, the elements of a matroid are presented to an onli...
Moshe Babaioff, Nicole Immorlica, Robert Kleinberg
JCT
2006
54views more  JCT 2006»
13 years 4 months ago
Matroid packing and covering with circuits through an element
Abstract. In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum number of disjoint circuits and
Manoel Lemos, James G. Oxley
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 4 months ago
On the Excluded Minors for Matroids of Branch-Width Three
Knowing the excluded minors for a minor-closed matroid property provides a useful alternative characterization of that property. It has been shown in [R. Hall, J. Oxley, C. Semple...
Petr Hlinený