Pages that link to "Item:Q4386448"
From MaRDI portal
The following pages link to NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs (Q4386448):
Displaying 26 items.
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- On the Power of Lookahead in Greedy Scheme for Finding a Minimum CDS for Unit Disk Graphs (Q2970204) (← links)
- Improper coloring of unit disk graphs (Q3057115) (← links)
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)
- A PTAS for the Weighted Unit Disk Cover Problem (Q3448847) (← links)
- Consensus Patterns (Probably) Has no EPTAS (Q3452789) (← links)
- Linear-Time Approximation Algorithms for Unit Disk Graphs (Q3453289) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- Maximum Independent Set on $$B_1$$ B 1 -VPG Graphs (Q3467876) (← links)
- Approximation Algorithms for Geometric Intersection Graphs (Q3508563) (← links)
- ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS (Q3560065) (← links)
- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs (Q3602842) (← links)
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847) (← links)
- ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS (Q3634205) (← links)
- (Q4474203) (← links)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- POINT SET LABELING WITH SPECIFIED POSITIONS (Q4818545) (← links)
- EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS (Q5189986) (← links)
- A PTAS for Weak Minimum Routing Cost Connected Dominating Set of Unit Disk Graph (Q5244687) (← links)
- Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes (Q5458525) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- DISTRIBUTED SPANNERS WITH BOUNDED DEGREE FOR WIRELESS AD HOC NETWORKS (Q5696901) (← links)
- (Q5708492) (← links)
- On Approximating (Connected) 2-Edge Dominating Set by a Tree (Q5740184) (← links)
- (Q5743499) (← links)