Un nuevo resultado sobre la complejidad del problema delP-centro
From MaRDI portal
Publication:3035114
DOI10.1007/BF02888418zbMATH Open0692.90042OpenAlexW1995647487MaRDI QIDQ3035114FDOQ3035114
Author name not available (Why is that?)
Publication date: 1990
Published in: Trabajos de Investigacion Operativa (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02888418
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05)
Cites Work
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- An efficient heuristic for large set covering problems
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- The m-Center Problem
- A correction to the definition of local center
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- New algorithms for \(k\)-center and extensions
- The complete vertex \(p\)-center problem
- Title not available (Why is that?)
- An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
- Generalized \(p\)-center problems: Complexity results and approximation algorithms
- On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
- Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
Recommendations
- On the complexity of the \((r|p)\)-centroid problem in the plane 👍 👎
- A new formulation and resolution method for the \(p\)-center problem 👍 👎
- The p-Centre Problem-Heuristic and Optimal Algorithms 👍 👎
- Generalized \(p\)-center problems: Complexity results and approximation algorithms 👍 👎
- On alternativep-center problems 👍 👎
- The parameterized complexity of the shared center problem 👍 👎
- A note on the p - center problem 👍 👎
- The complexity of generalized center problem 👍 👎
- Approximability results for the converse connectedp-centre problem† 👍 👎
- The Parameterized Complexity of the Shared Center Problem 👍 👎
This page was built for publication: Un nuevo resultado sobre la complejidad del problema delP-centro
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3035114)
