Minimum multiway cuts in trees
- 作者Péter L. Erdős; András Frank; László Székely
- 卷第87卷
- 印刷ISSN0166-218X
- 文件大小666.54KB
- 发表时间1998
- DOI10.1016/s0166-218x(98)00049-3
- 页码67-75
Margining option portfolios by network flowsDmytro Matsypura; Vadim G. Timkovsky · 2012
Non-similarity combinatorial problemsAnatoly R. Rubinov; Vadim G. Timkovsky · 1993
String Noninclusion Optimization ProblemsRubinov, Anatoly R.; Timkovsky, Vadim G. · SIAM Journal on Discrete Mathematics · 1998
Shortest consistent superstrings computable in polynomial timeTao Jiang; Vadim G. Timkovsky · 1995
On scheduling cycle shops: classification, complexity and approximationMartin Middendorf; Vadim G. Timkovsky · 2002
Basket problems in margin calculation: Modelling and algorithmsAlexander E. Fiterman; Vadim G. Timkovsky · 2001
Ten notes on equal-processing-time schedulingPhilippe Baptiste; Peter Brucker; Sigrid Knust; Vadim G. Timkovsky · 2004
Transversal Graphs for Partially Ordered Sets: Sequencing, Merging and Scheduling ProblemsMartin Middendorf; Vadim G. Timkovsky · Journal of Combinatorial Optimization · 1999