An Algorithm for Convex Polytopes
- 期刊名称Journal of the ACM
- 作者Chand, Donald R.; Kapur, Sham S.
- 卷第17卷
- 期第1期
- 印刷ISSN0004-5411
- 文件大小402.45KB
- 发表时间1970-1-1
- DOI10.1145/321556.321564
- 页码78-86
同作者推荐
Strategic Coloring of a GraphEscoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme · Internet Mathematics · 2012
The Price of Optimum: Complexity and Approximation for a Matching GameEscoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme · Algorithmica · 2017
Two-stage stochastic matching and spanning tree problems: Polynomial instances and approximationBruno Escoffier; Laurent Gourvès; Jérôme Monnot; Olivier Spanjaard · 2010
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphsBruno Escoffier; Laurent Gourvès; Jérôme Monnot · 2010