PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Konjevod, Goran"

Author of the publication

copydeleteadd this publication to your clipboard
Approximation algorithms for the covering Steiner problem.

, , and . Random Struct. Algorithms, 20 (3): 465-482 (2002)

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.

No persons found for author name Konjevod, Goran
add a person with the name Konjevod, Goran
 

Other publications of authors with the same name

A 2110-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem., , , and . J. Comb. Optim., 5 (3): 317-326 (2001)A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem., , and . J. Algorithms, 37 (1): 66-84 (2000)Approximation algorithms for the covering Steiner problem., , and . Random Struct. Algorithms, 20 (3): 465-482 (2002)Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems., , , and . Theor. Comput. Sci., 235 (1): 25-42 (2000)A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem., , and . SODA, page 253-259. ACM/SIAM, (1998)Randomized Postoptimization of Covering Arrays., , and . IWOCA, volume 5874 of Lecture Notes in Computer Science, page 408-419. Springer, (2009)Improved approximations for tour and tree covers., , , and . APPROX, volume 1913 of Lecture Notes in Computer Science, page 184-193. Springer, (2000)Combinational equivalence checking for threshold logic circuits., , and . ACM Great Lakes Symposium on VLSI, page 102-107. ACM, (2007)Randomized compact routing in decomposable metrics., , , and . PODC, page 351-352. ACM, (2011)Budget constrained minimum cost connected medians., , and . J. Discrete Algorithms, 2 (4): 453-469 (2004)