Label placement by maximum independent set in rectangles
From MaRDI portal
Recommendations
Cites work
- An efficient and effective approximation algorithm for the Map Labeling Problem
- Approximation schemes for covering and packing problems in image processing and VLSI
- Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 512838 (Why is no real title available?)
- scientific article; zbMATH DE number 6472588 (Why is no real title available?)
- Improved non-approximability results
- Optimal packing and covering in the plane are NP-complete
- Simple heuristics for unit disk graphs
Cited in
(88)- An upper bound for cubicity in terms of boxicity
- A note on maximum independent sets in rectangle intersection graphs
- Optimal algorithm for a special point-labeling problem
- Polynomial time algorithms for three-label point labeling.
- Hardness of approximation for non-overlapping local alignments.
- Fast stabbing of boxes in high dimensions
- Improved algorithms for resource allocation under varying capacity
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking
- Anchored rectangle and square packings
- Cubicity and bandwidth
- Trimming of graphs, with application to point labeling
- Packing and covering with non-piercing regions
- Limit theory of combinatorial optimization for random geometric graphs
- Finding geometric representations of apex graphs is NP-hard
- Collision-free routing problem with restricted L-path
- Efficient independent set approximation in unit disk graphs
- On grids in topological graphs
- A Lagrangean decomposition for the maximum independent set problem applied to map labeling
- Faster approximation for maximum independent set on unit disk graph
- Admission control with advance reservations in simple networks
- Independent set of intersection graphs of convex objects in 2D
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- Approximation algorithms on consistent dynamic map labeling
- Secure connected domination and secure total domination in unit disk graphs and rectangle graphs
- Improved algorithm for maximum independent set on unit disk graph
- On disjoint crossing families in geometric graphs
- A polynomial time solution for labeling a rectilinear map
- Labeling a rectilinear map more efficiently
- Mixed Map Labeling
- Coloring and maximum independent set of rectangles
- Determining a set of maximum inscribed rectangles for label placement in a region
- A (2+)-approximation algorithm for the storage allocation problem
- On the approximability of orthogonal order preserving layout adjustment
- Approximation Algorithms for Geometric Intersection Graphs
- Maximizing the Number of Independent Labels in the Plane
- On Map Labeling with Leaders
- On the cubicity of AT-free graphs and circular-arc graphs
- Optimization problems in dotted interval graphs
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Approximation algorithms for maximum independent set of pseudo-disks
- Geometric Packing under Nonuniform Constraints
- Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs
- Maximum independent set of rectangles
- Approximation algorithms for maximum independent set of a unit disk graph
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- Minimum point-overlap labelling*
- Matching colored points with rectangles
- Evaluation of labeling strategies for rotating maps
- Minimum point-overlap labeling
- Two Map Labeling Algorithms for GIS Applications
- Minimum vertex cover in rectangle graphs
- Graph Drawing
- scientific article; zbMATH DE number 7053376 (Why is no real title available?)
- scientific article; zbMATH DE number 7651158 (Why is no real title available?)
- Many disjoint edges in topological graphs
- Optimizing active ranges for consistent dynamic map labeling
- Disjoint edges in complete topological graphs
- Many disjoint edges in topological graphs
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams.
- Complexity and approximation for discriminating and identifying code problems in geometric setups
- Keep your distance: land division with separation
- An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling
- Finding geometric representations of apex graphs is \textsf{NP}-hard
- On streaming algorithms for geometric independent set and clique
- Recognizing geometric intersection graphs stabbed by a line
- A survey on variant domination problems in geometric intersection graphs
- Maximum bipartite subgraphs of geometric intersection graphs
- New partitioning techniques and faster algorithms for approximate interval scheduling
- An algorithm for the maximum weight independent set problem on outerstring graphs
- A survey on the boxicity and cubicity of graphs
- Approximation of MWIS on geometric intersection graphs
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- Boundary labeling in a circular orbit
- Maximum centre-disjoint mergeable disks
- The algorithm and complexity of secure domination in 3-dimensional box graphs
- On the geometric red-blue set cover problem
- Parameterized approximation for maximum weight independent set of rectangles and segments
- Fully dynamic maximum independent sets of disks in polylogarithmic update time
- Dynamic streaming algorithms for geometric independent set
- Structure and independence in hyperbolic uniform disk graphs
- Covering simple orthogonal polygons with rectangles
- In-place algorithms for computing a largest clique in geometric intersection graphs
- On the stab number of rectangle intersection graphs
- Balanced independent and dominating sets on colored interval graphs
- A randomized algorithm for online unit clustering
- Geometric representation of graphs in low dimension using axis parallel boxes
- Computationally-feasible truthful auctions for convex bundles
- A new fast heuristic for labeling points
This page was built for publication: Label placement by maximum independent set in rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276946)
