Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcss.2017.09.012 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance guarantees for the TSP with a parameterized triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(k\)-connectivity problems with sharpened triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the TSP with sharpened triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Approximation Algorithms and Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Lower Bounds on the Approximability of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Star k-Hub Center Problem in Metric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated single and multiple allocation \(p\)-hub center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the single-assignment \(p\)-hub center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness and approximation of the star \(p\)-hub center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-phase algorithm for solving the single allocation \(p\)-hub center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCSS.2017.09.012 / rank
 
Normal rank

Latest revision as of 02:50, 11 December 2024

scientific article
Language Label Description Also known as
English
Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality
scientific article

    Statements

    Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    14 November 2017
    0 references
    hub allocation
    0 references
    stability of approximation
    0 references
    \(\beta\)-triangle inequality
    0 references
    metric graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references