Pages that link to "Item:Q2428685"
From MaRDI portal
The following pages link to A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685):
Displaying 7 items.
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- An optimal maximal independent set algorithm for bounded-independence graphs (Q992507) (← links)
- A weakly robust PTAS for minimum clique partition in unit disk graphs (Q2428685) (← links)
- A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs (Q3569890) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- Approximation and Online Algorithms (Q5898481) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)