On the approximability of the single allocation p-hub center problem with parameterized triangle inequality
From MaRDI portal
Publication:2149101
Signed and weighted graphs (05C22) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Discrete location and assignment (90B80) Combinatorial optimization (90C27)
Recommendations
- The approximability of the \(p\)-hub center problem with parameterized triangle inequality
- On the single-assignment \(p\)-hub center problem
- A parameterized approximation algorithm for the multiple allocation \(k\)-hub center
- Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
- The \(p\)-hub center allocation problem
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
- A 2-phase algorithm for solving the single allocation p-hub center problem
- Uncapacitated single and multiple allocation \(p\)-hub center problems
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
- scientific article; zbMATH DE number 7219313
Cites work
- A 2-phase algorithm for solving the single allocation p-hub center problem
- A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
- A Modern View on Stability of Approximation
- An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality
- Analytical approach to parallel repetition
- Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
- Approximation algorithms for the star k-hub center problem in metric graphs
- Approximation algorithms for the TSP with sharpened triangle inequality
- General variable neighborhood search for the uncapacitated single allocation \(p\)-hub center problem
- scientific article; zbMATH DE number 1566497 (Why is no real title available?)
- scientific article; zbMATH DE number 1803765 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2011856 (Why is no real title available?)
- scientific article; zbMATH DE number 1500530 (Why is no real title available?)
- scientific article; zbMATH DE number 1408349 (Why is no real title available?)
- Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
- Integer programming formulations of discrete hub location problems
- Network hub location problems: The state of the art
- On k-connectivity problems with sharpened triangle inequality
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
- On the single-assignment \(p\)-hub center problem
- On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
- Optimizing fuzzy \( p\)-hub center problem with generalized value-at-risk criterion
- Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
- Performance guarantees for the TSP with a parameterized triangle inequality
- Star p-hub center problem and star p-hub median problem with bounded path lengths
- The hardness and approximation of the star \(p\)-hub center problem
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem.
- Uncapacitated single and multiple allocation \(p\)-hub center problems
Cited in
(8)- Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
- The approximability of the \(p\)-hub center problem with parameterized triangle inequality
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
- Hardness and approximation for the star -hub routing cost problem in _ -metric graphs
- On the hardness and approximation of the densest k-subgraph problem in parameterized metric graphs
- The \(p\)-hub center allocation problem
This page was built for publication: On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2149101)
