On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality

DOI10.1007/978-3-319-57586-5_14zbMATH Open1380.68310OpenAlexW2606457256MaRDI QIDQ5283364FDOQ5283364

Ralf Klasing, Sun-Yuan Hsieh, Chia-Wei Lee, Li-Hsuan Chen, Ling-Ju Hung, Bang Ye Wu

Publication date: 21 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_14

Recommendations

• Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality
• The approximability of the \(p\)-hub center problem with parameterized triangle inequality
• The hardness and approximation of the star \(p\)-hub center problem
• On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
• Approximation algorithms for the star \(k\)-hub center problem in metric graphs
• Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
• scientific article; zbMATH DE number 1285629
• Un nuevo resultado sobre la complejidad del problema delP-centro
• The parameterized complexity of the shared center problem
• The parameterized complexity of the shared center problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Cites Work

• Title not available (Why is that?)
• Integer programming formulations of discrete hub location problems
• Network hub location problems: The state of the art
• Title not available (Why is that?)
• Clustering to minimize the maximum intercluster distance
• Title not available (Why is that?)
• Performance guarantees for the TSP with a parameterized triangle inequality
• Approximation algorithms for the TSP with sharpened triangle inequality
• Title not available (Why is that?)
• Improved Lower Bounds on the Approximability of the Traveling Salesman Problem
• Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
• A 2-phase algorithm for solving the single allocation \(p\)-hub center problem
• Uncapacitated single and multiple allocation \(p\)-hub center problems
• On the single-assignment \(p\)-hub center problem
• A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem
• Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths
• On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality
• On \(k\)-connectivity problems with sharpened triangle inequality
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The hardness and approximation of the star \(p\)-hub center problem
• Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs

Cited In (3)

• On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality
• 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

This page was built for publication: On the Complexity of the Star 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 Q5283364)