Cover Image

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Grandoni, Fabrizio, Husić, Edin, Mari, Mathieu, Tinguely, Antoine
Format:	Preprint
Published:	2024
Subjects:	Computational Geometry Data Structures and Algorithms F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Approximability of Unsplittable Flow on a Path with Time Windows
by: Armbruster, Alexander, et al.
Published: (2025)

Online Maximum Independent Set of Hyperrectangles
by: Advani, Rishi, et al.
Published: (2023)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
by: Fekete, Sándor P., et al.
Published: (2024)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
by: Deligkas, Argyrios, et al.
Published: (2026)

Guarding Offices with Maximum Dispersion
by: Fekete, Sándor P., et al.
Published: (2025)

Structure and Independence in Hyperbolic Uniform Disk Graphs
by: Bläsius, Thomas, et al.
Published: (2024)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
by: Jansson, Jesper, et al.
Published: (2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
by: Gudmundsson, Joachim, et al.
Published: (2021)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
by: Fekete, Sándor P., et al.
Published: (2024)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
by: Faour, Salwa, et al.
Published: (2025)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
by: Le, Hung, et al.
Published: (2021)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
by: Buchin, Kevin, et al.
Published: (2026)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
by: Fekete, Sándor P., et al.
Published: (2025)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
by: Brankovic, Milutin, et al.
Published: (2021)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
by: de Berg, Mark, et al.
Published: (2026)

Guarding Polyominoes Under $k$-Hop Visibility
by: Filtser, Omrit, et al.
Published: (2023)

Sliding Squares in Parallel
by: Akitaya, Hugo A., et al.
Published: (2024)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
by: Gudmundsson, Joachim, et al.
Published: (2021)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
by: Gálvez, Waldo, et al.
Published: (2025)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
by: Aichholzer, Oswin, et al.
Published: (2026)

A Framework for Algorithm Stability
by: Meulemans, Wouter, et al.
Published: (2017)

Planar Network Diversion
by: Bentert, Matthias, et al.
Published: (2025)

Approximation algorithms for Job Scheduling with reconfigurable resources
by: Bergé, Pierre, et al.
Published: (2023)

A Deterministic Bicriteria Approximation Algorithm for the Art Gallery Problem
by: Elbassioni, Khaled
Published: (2025)

Maximum Matchings in Geometric Intersection Graphs
by: Bonnet, Édouard, et al.
Published: (2019)

Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
by: Ahn, Jungho, et al.
Published: (2025)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
by: DeHaan, Ian, et al.
Published: (2024)

Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)

Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
by: Kanellopoulos, Sotiris, et al.
Published: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)

Efficiently Reconfiguring a Connected Swarm of Labeled Robots
by: Fekete, Sándor P., et al.
Published: (2022)

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
by: Becker, Aaron T., et al.
Published: (2025)

Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
by: Dvořák, Pavel, et al.
Published: (2017)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
by: Bauernöppel, Frank, et al.
Published: (2025)

Approximate all-pairs Hamming distances and 0-1 matrix multiplication
by: Kowaluk, Miroslaw, et al.
Published: (2025)

Line Cover and Related Problems
by: Bentert, Matthias, et al.
Published: (2025)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
by: Chakrabarti, Amit, et al.
Published: (2024)

On Hardness and Approximation of Broadcasting in Structured Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)

Approximately Partitioning Vertices into Short Paths
by: Gong, Mingyang, et al.
Published: (2026)

Approximation algorithms for scheduling with rejection in green manufacturing
by: Gong, Mingyang, et al.
Published: (2025)