Pages that link to "Item:Q4962754"

The following pages link to Approximation schemes for wireless networks (Q4962754):

Displaying 17 items.

• Shifting strategy for geometric graphs without geometry (Q454249) (← links)
• Approximation algorithms for intersection graphs (Q476425) (← links)
• Polynomial time approximation schemes for minimum disk cover problems (Q613664) (← links)
• Minimum clique partition in unit disk graphs (Q659693) (← links)
• Sparse hop spanners for unit disk graphs (Q824328) (← links)
• PTAS for the minimum weighted dominating set in growth bounded graphs (Q1928314) (← links)
• Wireless networking, dominating and packing (Q1958633) (← links)
• Dominating set of rectangles intersecting a straight line (Q2025079) (← links)
• A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
• Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
• A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
• Efficient sub-5 approximations for minimum dominating sets in unit disk graphs (Q2453164) (← links)
• Linear-Time Approximation Algorithms for Unit Disk Graphs (Q3453289) (← links)
• Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
• (Q6065466) (← links)
• A survey on variant domination problems in geometric intersection graphs (Q6536206) (← links)
• PTASs for secure dominating set in planar graphs and growth-bounded graphs (Q6611035) (← links)