Author of the publication

Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs.

, , and . ISAAC, volume 1004 of Lecture Notes in Computer Science, page 142-151. Springer, (1995)

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

Approximating Maximum Independent Set in Bounded Degree Graphs., and . SODA, page 365-371. ACM/SIAM, (1994)Approximating Transitivity in Directed Networks, , and . CoRR, (2008)Improving the performance of k-means clustering through computation skipping and data locality optimizations., , and . Conf. Computing Frontiers, page 273-276. ACM, (2012)Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems., , and . COCOON, volume 6196 of Lecture Notes in Computer Science, page 226-234. Springer, (2010)Complexities of Efficient Solutions of Rectilinear Polygon Cover Problems., and . Algorithmica, 17 (4): 331-356 (1997)Improved approximation algorithms for rectangle tiling and packing., , , and . SODA, page 427-436. ACM/SIAM, (2001)Simple approximation algorithm for nonoverlapping local alignments., , and . SODA, page 677-678. ACM/SIAM, (2002)Towards Optimal Distributed Consensus (Extended Abstract), , and . FOCS, page 410-415. IEEE Computer Society, (1989)On-line Load Balancing for Related Machines., , and . WADS, volume 1272 of Lecture Notes in Computer Science, page 116-125. Springer, (1997)Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search., , , , , and . WABI, volume 2452 of Lecture Notes in Computer Science, page 419-433. Springer, (2002)