scientific article
From MaRDI portal
Publication:4037432
zbMath0765.68055MaRDI QIDQ4037432
S. S. Ravi, Giri Kumar Tayi, Daniel J. Rosenkrantz
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Related Items (14)
The \(p\)-neighbor \(k\)-center problem ⋮ A comparison of \(p\)-dispersion heuristics ⋮ Greedily finding a dense subgraph ⋮ \(k\)-edge subgraph problems ⋮ Representation of the non-dominated set in biobjective discrete optimization ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ Compact location problems with budget and communication constraints ⋮ Dispersing points on intervals ⋮ Sequential Design of Experiment for Sparse Polynomial Chaos Expansions ⋮ An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs ⋮ A heuristic approach for the max-min diversity problem based on max-clique ⋮ Integer-friendly formulations for the \(r\)-separation problem
This page was built for publication:
