Pages that link to "Item:Q3569890"
From MaRDI portal
The following pages link to A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs (Q3569890):
Displayed 5 items.
- Shifting strategy for geometric graphs without geometry (Q454249) (← links)
- Approximation algorithms for intersection graphs (Q476425) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation (Q3095042) (← links)