Matroid Secretary for Regular and Decomposable Matroids

In the matroid secretary problem we are given a stream of elements in random order and asked to choose a set of elements that maximizes the total value of the set, subject to being an independent set of a matroid given in advance. The difficulty comes from the assumption that decisions are irrevocab...

Full description

Bibliographic Details

Published in:	SIAM journal on computing Vol. 43; no. 5; pp. 1807 - 1830
Main Authors:	Dinitz, Michael, Kortsarz, Guy
Format:	Journal Article
Language:	English
Published:	01.01.2014
Subjects:	Algorithms Decisions Decomposition Graph theory Graphs Reproduction Streams Vector spaces Italy, Marche, Pesaro, Fano
ISSN:	0097-5397, 1095-7111
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!