Parameterized approximation for maximum weight independent set of rectangles and segments
From MaRDI portal
Cites work
- A 3-approximation algorithm for maximum independent set of rectangles
- A constant-factor approximation algorithm for unsplittable flow on paths
- A polynomial-time \(\mathrm{OPT}^\varepsilon\)-approximation algorithm for maximum independent set of connected subgraphs in a planar graph
- Algorithms – ESA 2005
- Approximating maximum independent set for rectangles in the plane
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation schemes for maximum weight independent set of rectangles
- Coloring and Maximum Weight Independent Set of Rectangles
- Data Mining with optimized two-dimensional association rules
- Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
- Graph minors. XIII: The disjoint paths problem
- scientific article; zbMATH DE number 1947059 (Why is no real title available?)
- Label placement by maximum independent set in rectangles
- On approximating maximum independent set of rectangles
- On the efficiency of polynomial time approximation schemes
- Optimal packing and covering in the plane are NP-complete
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack
- Parameterized Complexity of Independence and Domination on Geometric Graphs
- Point-Width and Max-CSPs
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs
- Treewidth-pliability and PTAS for Max-CSPs
This page was built for publication: Parameterized approximation for maximum weight independent set of rectangles and segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253100)
