Minimax parametric optimization problems and multi-dimensional parametric searching

DOI10.1145/380752.380777zbMath1323.90076OpenAlexW2129708407MaRDI QIDQ5175955

Takeshi Tokuyama

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380777

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (8)

Building bridges between convex regions ⋮ Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts ⋮ Averaging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spaces ⋮ Smoothing method for minimizing the sum of therlargest functions ⋮ An efficient algorithm for the Euclidean \(r\)-centrum location problem ⋮ Minimizing the sum of the \(k\) largest functions in linear time. ⋮ Algorithmic results for ordered median problems ⋮ Efficient algorithms for the minimum diameter bridge problem

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)

This page was built for publication: Minimax parametric optimization problems and multi-dimensional parametric searching