Pages that link to "Item:Q4698229"

The following pages link to Simple heuristics for unit disk graphs (Q4698229):

Displaying 37 items.

• Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
• Finding Large Independent Sets in Line of Sight Networks (Q2971663) (← links)
• Improper coloring of unit disk graphs (Q3057115) (← links)
• LEARNING AUTOMATA-BASED ALGORITHMS FOR FINDING MINIMUM WEAKLY CONNECTED DOMINATING SET IN STOCHASTIC GRAPHS (Q3070074) (← links)
• A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)
• Linear-Time Approximation Algorithms for Unit Disk Graphs (Q3453289) (← links)
• Algorithms for Steiner Connected Dominating Set Problem Based on Learning Automata Theory (Q3455753) (← links)
• Minimum Dominating Set Problem for Unit Disks Revisited (Q3459050) (← links)
• Approximation Algorithms for Geometric Intersection Graphs (Q3508563) (← links)
• ROMAN DOMINATION AND ITS VARIANTS IN UNIT DISK GRAPHS (Q3560065) (← links)
• MAXIMUM AREA INDEPENDENT SETS IN DISK INTERSECTION GRAPHS (Q3562849) (← links)
• A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET (Q3569287) (← links)
• Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs (Q3602842) (← links)
• ANALYSIS ON THEORETICAL BOUNDS FOR APPROXIMATING DOMINATING SET PROBLEMS (Q3634205) (← links)
• Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
• EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS (Q5189986) (← links)
• LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS (Q5189993) (← links)
• (Q5240127) (← links)
• Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs (Q5302070) (← links)
• On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks (Q5445787) (← links)
• Domination in Geometric Intersection Graphs (Q5458576) (← links)
• MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS (Q5696910) (← links)
• A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS (Q5696912) (← links)
• (Q5708492) (← links)
• (Q5743499) (← links)
• Approximating k-Connected m-Dominating Sets (Q5874545) (← links)
• (Q5875486) (← links)
• Dynamic graph coloring (Q5915986) (← links)
• Nonoverlapping local alignments (weighted independent sets of axis-parallel rectangles) (Q5961617) (← links)
• Binary programming formulations for the upper domination problem (Q6080758) (← links)
• Algorithmic aspects of secure domination in unit disk graphs (Q6186318) (← links)
• A survey on variant domination problems in geometric intersection graphs (Q6536206) (← links)
• Semi-total domination in unit disk graphs (Q6547828) (← links)
• On the hardness of allocating frequencies for hybrid networks (Q6550553) (← links)
• Annulus graphs in \(\mathbb{R}^d\) (Q6559437) (← links)
• Online dominating set and coloring (Q6606165) (← links)
• Total (restrained) domination in unit disk graphs (Q6614890) (← links)