scientific article; zbMATH DE number 7651158
From MaRDI portal
Publication:5874486
DOI10.4230/LIPIcs.ESA.2020.19MaRDI QIDQ5874486
Martin Nöllenburg, Guangping Li, Sujoy Bhore
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2002.07611
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
independent setsapproximation algorithmsdynamic algorithmsrectangle intersection graphsexperimental evaluation
Related Items (1)
Uses Software
Cites Work
- Approximation algorithms for maximum independent set of pseudo-disks
- Dynamic algorithms for monotonic interval scheduling problem
- Interval scheduling and colorful independent sets
- Dynamic fractional cascading
- Optimal packing and covering in the plane are NP-complete
- Label placement by maximum independent set in rectangles
- The maximum clique problem
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time
- Consistent labeling of rotating maps
- Finding a Maximum Clique in an Arbitrary Graph
- Approximation schemes for covering and packing problems in image processing and VLSI
- Efficient algorithms for interval graphs and circular-arc graphs
- Dynamic Orthogonal Range Searching on the RAM, Revisited
- Reducibility among Combinatorial Problems
- Dynamic set cover: improved algorithms and lower bounds
- Fully dynamic maximal independent set with sublinear update time
- A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
- Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Optimizing active ranges for consistent dynamic map labeling
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
