Pages that link to "Item:Q4698229"
From MaRDI portal
The following pages link to Simple heuristics for unit disk graphs (Q4698229):
Displaying 50 items.
- Distributed minimum dominating set approximations in restricted families of graphs (Q360271) (← links)
- A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs (Q418750) (← links)
- Approximation algorithms for maximum independent set of pseudo-disks (Q452004) (← links)
- Note on coloring of double disk graphs (Q475816) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- On the recognition of unit disk graphs and the distance geometry problem with ranges (Q499355) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Location-oblivious distributed unit disk graph coloring (Q534767) (← links)
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Clustering the wireless ad hoc networks: a distributed learning automata approach (Q666084) (← links)
- Finding minimum weight connected dominating set in stochastic graph based on learning automata (Q712488) (← links)
- On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
- In-place algorithms for computing a largest clique in geometric intersection graphs (Q741534) (← links)
- A randomized algorithm for online unit clustering (Q839627) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs (Q906392) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph (Q1006048) (← links)
- Local edge colouring of Yao-like subgraphs of unit disk graphs (Q1008738) (← links)
- Maximum scan statistics and channel assignment problems in homogeneous wireless networks (Q1019740) (← links)
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs (Q1029052) (← links)
- A better constant-factor approximation for weighted dominating set in unit disk graph (Q1037452) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- On the hardness of allocating frequencies for hybrid networks (Q1274935) (← links)
- Label placement by maximum independent set in rectangles (Q1276946) (← links)
- Impact of locality on location aware unit disk graphs (Q1662429) (← links)
- Locating battery charging stations to facilitate almost shortest paths (Q1720301) (← links)
- Approximation algorithms for highly connected multi-dominating sets in unit disk graphs (Q1755744) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes (Q1958629) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Independent sets in Line of Sight networks (Q2201775) (← links)
- Computing inductive vertex orderings (Q2234785) (← links)
- Minimum vertex cover in ball graphs through local search (Q2250102) (← links)
- Approximation algorithms for the connected sensor cover problem (Q2290655) (← links)
- Fair and square: cake-cutting in two dimensions (Q2358562) (← links)
- On spectrum sharing games (Q2377140) (← links)
- A tight bound for online colouring of disk graphs (Q2382668) (← links)
- Faster approximation for maximum independent set on unit disk graph (Q2398507) (← links)
- Local 7-coloring for planar subgraphs of unit disk graphs (Q2430012) (← links)
- Learning bounds via sample width for classifiers on finite metric spaces (Q2440828) (← links)
- Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164) (← links)
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
- The number of disk graphs (Q2509768) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← links)
- APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS (Q2932520) (← links)
