scientific article; zbMATH DE number 7651158
From MaRDI portal
Publication:5874486
DOI10.4230/LIPICS.ESA.2020.19MaRDI QIDQ5874486FDOQ5874486
Authors: Sujoy Bhore, Guangping Li, Martin Nöllenburg 
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2002.07611
Title of this publication is not available (Why is that?)
Recommendations
- Approximation algorithms on consistent dynamic map labeling
- Approximation Algorithms on Consistent Dynamic Map Labeling
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling
- scientific article; zbMATH DE number 1696627
- Approximation algorithms for independent sets in map graphs
- An efficient and effective approximation algorithm for the Map Labeling Problem
- Publication:2729098
- A dynamic survey of graph labeling
- New approximation algorithms for map labeling with sliding labels
- An algorithmic framework for labeling network maps
approximation algorithmsindependent setsrectangle intersection graphsdynamic algorithmsexperimental evaluation
Cites Work
- Title not available (Why is that?)
- The maximum clique problem
- Reducibility among Combinatorial Problems
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Efficient algorithms for interval graphs and circular-arc graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Finding a Maximum Clique in an Arbitrary Graph
- Approximation schemes for covering and packing problems in image processing and VLSI
- Dynamic fractional cascading
- Optimal packing and covering in the plane are NP-complete
- Title not available (Why is that?)
- Label placement by maximum independent set in rectangles
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Optimizing active ranges for consistent dynamic map labeling
- Approximation algorithms for maximum independent set of pseudo-disks
- Dynamic algorithms for monotonic interval scheduling problem
- Title not available (Why is that?)
- A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching
- Interval scheduling and colorful independent sets
- Dynamic set cover: improved algorithms and lower bounds
- Consistent labeling of rotating maps
- Title not available (Why is that?)
- Deterministic fully dynamic approximate vertex cover and fractional matching in \(O(1)\) amortized update time
- Title not available (Why is that?)
- Fully dynamic maximal independent set with sublinear update time
- Dynamic Orthogonal Range Searching on the RAM, Revisited
- Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
Cited In (3)
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874486)
