A PTAS is presented for the team order problem to find an ordering achieving winning probability within epsilon of the optimum, plus tractability results for special cases and a bound on maximum-weight matching performance.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Team Order Problem: Maximizing the Probability of Matching Being Large Enough
A PTAS is presented for the team order problem to find an ordering achieving winning probability within epsilon of the optimum, plus tractability results for special cases and a bound on maximum-weight matching performance.