Lower bounds for testing Euclidean Minimum Spanning Trees
- 作者Oren Ben-Zwi; Oded Lachish; Ilan Newman
- 卷第102卷
- 期第6期
- 印刷ISSN0020-0190
- 文件大小158.33KB
- 发表时间2007
- DOI10.1016/j.ipl.2006.12.011
- 页码219-225
CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMSMELKONIAN, VARDGES · Discrete Mathematics, Algorithms and Applications · 2011
On Binary Representation of IntegersMelkonian, Vardges · PRIMUS · 2019
New primal–dual algorithms for Steiner tree problemsVardges Melkonian · 2007
Flows in dynamic networks with aggregate arc capacitiesVardges Melkonian · 2007
Algorithms for a network design problem with crossing supermodular demandsVardges Melkonian; Éva Tardos · 2004
Primal-Dual-Based Algorithms for a Directed Network Design ProblemMelkonian, Vardges; Tardos, Éva · INFORMS Journal on Computing · 2005
A computational model of politicians bureaucracy relationship in a competitively authoritarian environmentLskavyan, Vahe; Melkonian, Vardges · International Journal of Computational Economics and Econometrics · 2011