The following pages link to (Q4504025):
Displaying 21 items.
- Approximation algorithms for maximum independent set of a unit disk graph (Q483059) (← links)
- The within-strip discrete unit disk cover problem (Q528480) (← links)
- Reverse shortest path problem for unit-disk graphs (Q832915) (← links)
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs (Q867854) (← links)
- Local edge colouring of Yao-like subgraphs of unit disk graphs (Q1008738) (← links)
- Perfectness and imperfectness of unit disk graphs on triangular lattice points (Q1043621) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Efficient independent set approximation in unit disk graphs (Q2181244) (← links)
- Near-optimal algorithms for shortest paths in weighted unit-disk graphs (Q2223616) (← links)
- Faster approximation for maximum independent set on unit disk graph (Q2398507) (← links)
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
- An approximation algorithm for the general max-min resource sharing problem (Q2492678) (← links)
- The number of disk graphs (Q2509768) (← links)
- An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs (Q2678259) (← links)
- Improved Algorithm for Maximum Independent Set on Unit Disk Graph (Q2795948) (← 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)
- Shifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection Graphs (Q4605337) (← links)
- Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. (Q5088993) (← links)
- (Q5708492) (← links)
- (Q5875486) (← links)
