Pages that link to "Item:Q5317197"
From MaRDI portal
The following pages link to Polynomial-Time Approximation Schemes for Geometric Intersection Graphs (Q5317197):
Displaying 50 items.
- Optimization problems in dotted interval graphs (Q400519) (← links)
- PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs (Q411246) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- Matching colored points with rectangles (Q511687) (← links)
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- Minimum cuts in geometric intersection graphs (Q827339) (← links)
- Generalized disk graphs (Q832849) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
- On covering problems of Rado (Q970613) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- PTAS for connected vertex cover in unit disk graphs (Q1040582) (← links)
- Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Independent set of convex polygons: from \(n^{\epsilon}\) to \(1+\epsilon \) via shrinking (Q1742371) (← links)
- Anchored rectangle and square packings (Q1751252) (← links)
- PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
- Cubicity and bandwidth (Q1938886) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- Range assignment of base-stations maximizing coverage area without interference (Q2283033) (← links)
- The number of disk graphs (Q2509768) (← links)
- Approximation algorithms for the minimum power cover problem with submodular/linear penalties (Q2672626) (← links)
- Polynomial-time approximation schemes for geometric graphs (Q2768362) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- Approximation Algorithms for Geometric Intersection Graphs (Q3508563) (← links)
- On Covering Problems of Rado (Q3512467) (← links)
- MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS (Q3562849) (← links)
- Geometric Intersection Graphs: Do Short Cycles Help? (Q3608838) (← links)
- On the Cubicity of AT-Free Graphs and Circular-Arc Graphs (Q3655149) (← links)
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs (Q4386448) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- Approximation and Parameterized Algorithms for Geometric Independent Set with Shrinking (Q5111257) (← links)
- (Q5115779) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- Polynomial Time Approximation Scheme for Connected Vertex Cover in Unit Disk Graph (Q5505664) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710802) (← links)
- (Q5743499) (← links)
- (Q5874486) (← links)
- Optimizing active ranges for consistent dynamic map labeling (Q5902232) (← links)
- Computing maximum independent set on outerstring graphs and their relatives (Q5918655) (← links)
