( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the complexity of finding multi-constrained spanning trees.

, , и . Discret. Appl. Math., 5 (1): 39-50 (1983)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Fabrizio Galbiati

Giulia Agostini

Giulia Calenda

Giulia Zancolli

Giulia Morra

 

Другие публикации лиц с тем же именем

Approximability of hard combinatorial optimization problems: an introduction., и . Ann. Oper. Res., 96 (1-4): 221-236 (2000)On the complexity of finding multi-constrained spanning trees., , и . Discret. Appl. Math., 5 (1): 39-50 (1983)On Minimum Changeover Cost Arborescences., , и . SEA, том 6630 из Lecture Notes in Computer Science, стр. 112-123. Springer, (2011)Modular Arithmetic and Randomization for Exact Matroid Problems., , и . IPCO, стр. 101-113. University of Waterloo Press, (1990)On Min-Max Cycle Bases.. ISAAC, том 2223 из Lecture Notes in Computer Science, стр. 116-123. Springer, (2001)On the Approximability of the Minimum Fundamental Cycle Basis Problem., и . WAOA, том 2909 из Lecture Notes in Computer Science, стр. 151-164. Springer, (2003)On the Approximability of some Maximum Spanning Tree Problems., , и . LATIN, том 911 из Lecture Notes in Computer Science, стр. 300-310. Springer, (1995)On Optimum Cycle Bases.. Electron. Notes Discret. Math., (2001)on the Computation of Pfaffians., и . Discret. Appl. Math., 51 (3): 269-275 (1994)Coloring of paths into forests., и . CTW, том WP 13-01 из CTIT Workshop Proceedings, стр. 113-116. (2013)