Author of the publication

A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph.

, , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 478-489. Springer, (2001)

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

A Polynomial-Space Exact Algorithm for TSP in Degree-6 Graphs., , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 228-240. Springer, (2015)Kernel Methods for Chemical Compounds: From Classification to Design., and . IEICE Trans. Inf. Syst., 94-D (10): 1846-1853 (2011)On the approximation of the generalized capacitated tree-routing problem., and . J. Discrete Algorithms, 8 (3): 311-320 (2010)Unranking of small combinations from large sets., , and . J. Discrete Algorithms, (2014)An improved approximation algorithm for capacitated multicast routings in networks., and . Theor. Comput. Sci., 390 (1): 81-91 (2008)Bounded-Degree Cut is Fixed-Parameter Tractable., and . CoRR, (2020)Multicommodity flows in certain planar directed networks., and . Discret. Appl. Math., 27 (1-2): 125-145 (1990)On the enumeration of minimal non-pairwise compatibility graphs., , and . J. Comb. Optim., 44 (4): 2871-2892 (2022)A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags., and . ISAAC, volume 2906 of Lecture Notes in Computer Science, page 309-318. Springer, (2003)A Linear-Time Algorithm for Integral Multiterminal Flows in Trees., and . ISAAC, volume 64 of LIPIcs, page 62:1-62:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)