Approximation in (Poly-) Logarithmic Space

Arindam Biswas, Venkatesh Raman, Saket Saurabh

Type: Preprint

Publication Date: 2020-08-10

Citations: 0

Locations

arXiv (Cornell University) - View

Similar Works

Action	Title	Year	Authors
+	Approximation in (Poly-) Logarithmic Space	2020	Arindam Biswas Venkatesh Raman Saket Saurabh
+	Lossy Kernelization for (Implicit) Hitting Set Problems	2023	Fedor V. Fomin Tien-Nam Le Daniel Lokshtanov Saket Saurabh Stéphan Thomassé Meirav Zehavi
+	Super-Fast 3-Ruling Sets	2012	Kishore Kothapalli Sriram V. Pemmaraju
+	Super-Fast 3-Ruling Sets	2012	Kishore Kothapalli Sriram V. Pemmaraju
+	Approximation algorithms for graph problems	2008	Shiva Prasad Kasiviswanathan
+ PDF Chat	Lower bounds for graph reconstruction with maximal independent set queries	2024	Lukas Michel Alex Scott
+	Exponential-Time Approximation of Hard Problems	2008	Marek Cygan Łukasz Kowalik Marcin Pilipczuk Mateusz Wykurz
+	Approximate Set Union Via Approximate Randomization	2018	Bin Fu Pengfei Gu Yuming Zhao
+	A shortcut to (sun)flowers: Kernels in logarithmic space or linear time	2015	Stefan Fafianie Stefan Kratsch
+	A shortcut to (sun)flowers: Kernels in logarithmic space or linear time	2015	Stefan Fafianie Stefan Kratsch
+	Improved (In-)Approximability Bounds for d-Scattered Set	2019	Ioannis Katsikarelis Michael Lampis Vangélis Th. Paschos
+	Approximate Turing Kernelization for Problems Parameterized by Treewidth	2020	Eva-Maria C. Hols Stefan Kratsch Astrid Pieterse
+	Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs	2015	Sariel Har-Peled Kent Quanrud
+	Lossy Kernels for Connected Dominating Set on Sparse Graphs	2017	Eduard Eiben Mithilesh Kumar Amer E. Mouawad Fahad Panolan Sebastian Siebertz
+ PDF Chat	Lossy Kernels for Connected Dominating Set on Sparse Graphs	2019	Eduard Eiben Mithilesh Kumar Amer E. Mouawad Fahad Panolan Sebastian Siebertz
+	Improved (In-)Approximability Bounds for d-Scattered Set	2023	Ioannis Katsikarelis Michael Lampis Vangélis Th. Paschos
+ PDF Chat	Approximation in (Poly-) Logarithmic Space	2021	Arindam Biswas Venkatesh Raman Saket Saurabh
+ PDF Chat	Towards Constant-Factor Approximation for Chordal/Distance-Hereditary Vertex Deletion	2022	Jungho Ahn Eun Jung Kim Euiwoong Lee
+	A Framework for Approximation Schemes on Disk Graphs	2022	Daniel Lokshtanov Fahad Panolan Saket Saurabh Jie Xue Meirav Zehavi
+	New Tools and Connections for Exponential-time Approximation	2017	Nikhil Bansal Parinya Chalermsook Bundit Laekhanukit Danupon Nanongkai Jesper Nederlof

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (5)

Action	Title	Year	Authors
+	Approximating linear programming is log-space complete for P	1991	Marı́a Serna
+ PDF Chat	Analytical approach to parallel repetition	2014	Irit Dinur David Steurer
+	A parallel approximation algorithm for positive linear programming	1993	Michael Luby Noam Nisan
+	A shortcut to (sun)flowers: Kernels in logarithmic space or linear time	2015	Stefan Fafianie Stefan Kratsch
+ PDF Chat	Approximation in (Poly-) Logarithmic Space	2021	Arindam Biswas Venkatesh Raman Saket Saurabh