External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems

Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh 0001, Meirav Zehavi. Polylogarithmic Approximation Algorithms for Weighted-F-Deletion Problems. In Eric Blais, Klaus Jansen, José D. P. Rolim, David Steurer, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA. Volume 116 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Authors

Akanksha Agrawal

This author has not been identified. Look up 'Akanksha Agrawal' in Google

Daniel Lokshtanov

This author has not been identified. Look up 'Daniel Lokshtanov' in Google

Pranabendu Misra

This author has not been identified. Look up 'Pranabendu Misra' in Google

Saket Saurabh 0001

This author has not been identified. Look up 'Saket Saurabh 0001' in Google

Meirav Zehavi

This author has not been identified. Look up 'Meirav Zehavi' in Google
runs on