Pages that link to "Item:Q3580956"
From MaRDI portal
The following pages link to Asymmetric k-center is log <sup>*</sup> <i>n</i> -hard to approximate (Q3580956):
Displaying 5 items.
- Complete partitions of graphs (Q949754) (← links)
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
- Asymmetric \(k\)-center with minimum coverage (Q2380063) (← links)
- Asymmetry in \(k\)-center variants (Q2503348) (← links)
- Efficiently computing succinct trade-off curves (Q2581275) (← links)
