scientific article; zbMATH DE number 1757943
From MaRDI portal
Publication:4537730
zbMath1010.90513MaRDI QIDQ4537730
Publication date: 20 June 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2081/20810001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (11)
A simple greedy approximation algorithm for the minimum connected \(k\)-center problem ⋮ Asymmetric \(k\)-center with minimum coverage ⋮ Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs ⋮ Min-Max-Min Optimization with Smooth and Strongly Convex Objectives ⋮ Client assignment problems for latency minimization ⋮ Unnamed Item ⋮ Discrete sensor placement problems in distribution networks ⋮ Asymmetry in \(k\)-center variants ⋮ Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs ⋮ Approximating Distance Measures for the Skyline ⋮ Efficiently computing succinct trade-off curves
This page was built for publication:
