Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (2024) Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. In: In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). APPROX/RANDOM 2024, 28-30 Aug 2024, London. Leibniz International Proceedings in Informatics (LIPIcs), 317 . LIPIcs , Wadern, Germany , 6:1-6:14. ISBN 978-3-95977-348-5

Abstract

Metadata

Item Type: Proceedings Paper
Authors/Creators:
Copyright, Publisher and Additional Information:

© Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Jie Xue, and Meirav Zehavi; licensed under Creative Commons License CC-BY 4.0.

Keywords: bipartization, geometric intersection graphs, approximation algorithms
Dates:
  • Published: 16 September 2024
  • Published (online): 16 September 2024
  • Accepted: 1 July 2024
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Algorithms & Complexity
Depositing User: Symplectic Publications
Date Deposited: 20 Aug 2024 11:58
Last Modified: 23 Sep 2024 16:23
Published Version: https://drops.dagstuhl.de/entities/document/10.423...
Status: Published
Publisher: LIPIcs
Series Name: Leibniz International Proceedings in Informatics (LIPIcs)
Identification Number: 10.4230/LIPIcs.APPROX/RANDOM.2024.6
Open Archives Initiative ID (OAI ID):

Export

Statistics