( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks.

, , , и . CALDAM, том 13179 из Lecture Notes in Computer Science, стр. 292-304. Springer, (2022)

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.

Matthew D Hockenos

Daniel Williamson

Elke Williamson

Adam Williamson

Adam Williamson

 

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

Corrigendum to Ön the negative cost girth problem in planar networks" Journal of Discrete Algorithms 35 (2015) 40-50., и . J. Discrete Algorithms, (2016)On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem., , и . J. Graph Algorithms Appl., 21 (2): 177-181 (2017)Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem., , и . Algorithmica, 74 (1): 270-325 (2016)A Parallel Implementation for the Negative Cost Girth Problem., и . Int. J. Parallel Program., 43 (2): 240-259 (2015)Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints., , и . Discret. Appl. Math., (2021)On the analysis of optimization problems in arc-dependent networks., , и . Discret. Optim., (2022)On the Approximability of Path and Cycle Problems in Arc-Dependent Networks., , , и . CALDAM, том 13179 из Lecture Notes in Computer Science, стр. 292-304. Springer, (2022)A new algorithm for the minimum spanning tree verification problem., и . Comput. Optim. Appl., 61 (1): 189-204 (2015)On approximating optimal weight "no"-certificates in weighted difference constraint systems., , , и . J. Comb. Optim., 36 (2): 329-345 (2018)Empirical analysis of algorithms for the shortest negative cost cycle problem., , и . Discret. Appl. Math., (2019)