Author of the publication

Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.

, , , , and . AAIM, volume 6124 of Lecture Notes in Computer Science, page 13-24. Springer, (2010)

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

Approximability of the Minimum Weighted Doubly Resolving Set Problem., and . COCOON, volume 8591 of Lecture Notes in Computer Science, page 357-368. Springer, (2014)Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design., and . Algorithmica, 53 (3): 263-297 (2009)A new model for path planning with interval data., , and . Comput. Oper. Res., 36 (6): 1893-1899 (2009)Excluding Braess's Paradox in Nonatomic Selfish Routing., , and . SAGT, volume 9347 of Lecture Notes in Computer Science, page 219-230. Springer, (2015)An Efficient Algorithm for Finding Maximum Cycle Packings in Reducible Flow Graphs., and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 306-317. Springer, (2004)How to Schedule the Marketing of Products with Negative Externalities., , and . COCOON, volume 7936 of Lecture Notes in Computer Science, page 122-133. Springer, (2013)Algorithms for the Ring Star Problem., , , , and . COCOA (2), volume 10628 of Lecture Notes in Computer Science, page 3-16. Springer, (2017)A Characterization of Box-Mengerian Matroid Ports., , and . Math. Oper. Res., 33 (2): 497-512 (2008)A Min-Max Relation on Packing Feedback Vertex Sets., , , and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 126-135. Springer, (2005)On the Minimum Risk-Sum Path Problem., , and . ESCAPE, volume 4614 of Lecture Notes in Computer Science, page 175-185. Springer, (2007)