scientific article; zbMATH DE number 1757943
From MaRDI portal
Publication:4537730
Recommendations
- Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- Asymmetric k -center is log * n -hard to approximate
- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
- scientific article; zbMATH DE number 871893
Cited in
(17)- Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs
- Asymmetric \(k\)-center with minimum coverage
- Client assignment problems for latency minimization
- Discrete sensor placement problems in distribution networks
- Asymmetry in \(k\)-center variants
- Efficiently computing succinct trade-off curves
- A simple greedy approximation algorithm for the minimum connected k-center problem
- Optimal lower bounds for universal and differentially private Steiner trees and TSPs
- Asymmetric k -center is log * n -hard to approximate
- Asymmetric \(k\)-center is \(\log{^*}{n}\)-hard to approximate
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- scientific article; zbMATH DE number 871893 (Why is no real title available?)
- scientific article; zbMATH DE number 7378621 (Why is no real title available?)
- Approximating Distance Measures for the Skyline
- Asymmetry in \(k\)-center variants
- Min-Max-Min Optimization with Smooth and Strongly Convex Objectives
- An improved two-stage approximation algorithm for the k-supplier problem with parameterized triangle inequality
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537730)
