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