Author of the publication

Approximating Minimum Label s-t Cut via Linear Programming.

, and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 655-666. Springer, (2012)

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

Derandomizing Graph Tests for Homomorphism., and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 105-115. Springer, (2008)Definable Filters in the Structure of Bounded Turing Reductions., , , and . TAMC, volume 4978 of Lecture Notes in Computer Science, page 116-124. Springer, (2008)Approximating Minimum Label s-t Cut via Linear Programming., and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 655-666. Springer, (2012)Principal filters definable by parameters in EbT., , , and . Math. Struct. Comput. Sci., 19 (1): 153-167 (2009)Minimum Label s-t Cut has large integrality gaps., and . Inf. Comput., (2020)Approximation and hardness results for label cut and related problems., , , and . J. Comb. Optim., 21 (2): 192-208 (2011)On the derandomization of the graph test for homomorphism over groups.. Theor. Comput. Sci., 412 (18): 1718-1728 (2011)Approximation and Hardness Results for Label Cut and Related Problems., , , and . TAMC, volume 5532 of Lecture Notes in Computer Science, page 460-469. Springer, (2009)Simpler and Better Approximation Algorithms for the Unweighted Minimum Label s-t Cut Problem., , and . Algorithmica, 80 (1): 398-409 (2018)The Complexity and Approximability of Minimum Contamination Problems., and . TAMC, volume 6648 of Lecture Notes in Computer Science, page 298-307. Springer, (2011)