Author of the publication

On the complexity of finding multi-constrained spanning trees.

, , and . 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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On Minimum Changeover Cost Arborescences., , and . SEA, volume 6630 of Lecture Notes in Computer Science, page 112-123. Springer, (2011)Approximability of hard combinatorial optimization problems: an introduction., and . Ann. Oper. Res., 96 (1-4): 221-236 (2000)On the complexity of finding multi-constrained spanning trees., , and . Discret. Appl. Math., 5 (1): 39-50 (1983)On the Approximability of some Maximum Spanning Tree Problems., , and . LATIN, volume 911 of Lecture Notes in Computer Science, page 300-310. Springer, (1995)Modular Arithmetic and Randomization for Exact Matroid Problems., , and . IPCO, page 101-113. University of Waterloo Press, (1990)On the Approximability of the Minimum Fundamental Cycle Basis Problem., and . WAOA, volume 2909 of Lecture Notes in Computer Science, page 151-164. Springer, (2003)On Min-Max Cycle Bases.. ISAAC, volume 2223 of Lecture Notes in Computer Science, page 116-123. Springer, (2001)On Optimum Cycle Bases.. Electron. Notes Discret. Math., (2001)on the Computation of Pfaffians., and . Discret. Appl. Math., 51 (3): 269-275 (1994)On finding cycle bases and fundamental cycle bases with a shortest maximal cycle.. Inf. Process. Lett., 88 (4): 155-159 (2003)