Pages that link to "Item:Q5898481"
From MaRDI portal
The following pages link to Approximation and Online Algorithms (Q5898481):
Displaying 26 items.
- A PTAS for the minimum weighted dominating set problem with smooth weights on unit disk graphs (Q437046) (← links)
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- On pseudo-disk hypergraphs (Q827317) (← links)
- Node-weighted Steiner tree approximation in unit disk graphs (Q849134) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- A randomized algorithm for determining dominating sets in graphs of maximum degree five (Q1034633) (← links)
- Impact of locality on location aware unit disk graphs (Q1662429) (← links)
- The \(k\)-hop connected dominating set problem: approximation and hardness (Q1679503) (← links)
- A PTAS for minimum \(d\)-hop connected dominating set in growth-bounded graphs (Q1958631) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Parallel algorithm for minimum partial dominating set in unit disk graph (Q2150577) (← links)
- A linear-time algorithm for minimum \(k\)-hop dominating set of a cactus graph (Q2166266) (← links)
- Liar's domination in unit disk graphs (Q2207495) (← links)
- On the approximability and hardness of the minimum connected dominating set with routing cost constraint (Q2326407) (← links)
- Polynomial-time approximation schemes for piercing and covering with applications in wireless networks (Q2477196) (← links)
- The number of disk graphs (Q2509768) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs (Q3602842) (← 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)
- Upper and lower bounds on approximating weighted mixed domination (Q5918569) (← links)
- Vertex-edge domination in unit disk graphs (Q5918769) (← links)
- Algorithmic aspects of secure domination in unit disk graphs (Q6186318) (← links)
- Semi-total domination in unit disk graphs (Q6547828) (← links)
