9.8k citations
- Tata Institute of Fundamental ResearchIN37 papers
- Centre National de la Recherche ScientifiqueFR31 papers
- Pennsylvania State UniversityUS31 papers
- International Centre for Theoretical SciencesIN29 papers
- Cardiff UniversityGB28 papers
- Indian Institute of Science Education and Research KolkataIN27 papers
- Indian Institute of Technology GandhinagarIN27 papers
- Institute for Plasma ResearchIN27 papers
- Syracuse UniversityUS27 papers
- Université Paris CitéFR27 papers
- California Institute of TechnologyUS26 papers
- Columbia UniversityUS26 papers
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2021
-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms
Fredrik Manne, Geevarghese Philip, Saket Saurabh +1
Lokshtanov et al.~[STOC 2017] introduced \emph{lossy kernelization} as a mathematical framework for quantifying the effectiveness of preprocessing algorithms in preserving approxim…
cs.DS2019★ 13 cited
FPT Algorithms for Diverse Collections of Hitting Sets
Julien Baste, Lars Jaffke, Tomáš Masařík +2
In this work, we study the -Hitting Set and Feedback Vertex Set problems through the paradigm of finding diverse collections of solutions of size at most each, which has…
cs.DS2010
Popularity at Minimum Cost
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbhorkar
We consider an extension of the {\em popular matching} problem in this paper. The input to the popular matching problem is a bipartite graph G = (A U B,E), where A is a set of peop…