Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-018-0455-0 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q5417667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: VC-Dimension and Shortest Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highway Dimension and Provably Efficient Shortest Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some APX-completeness results for cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search-Space Size in Contraction Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for ( <i>k</i> , <i>r</i> )-center in planar graphs and map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Hardness of the k-Center Problem in Transportation Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy and hard bottleneck location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5136270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of centers locating in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129892606 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-018-0455-0 / rank
 
Normal rank

Latest revision as of 00:25, 10 December 2024

scientific article
Language Label Description Also known as
English
Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs
scientific article

    Statements

    Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (English)
    0 references
    0 references
    11 March 2019
    0 references
    parameterized approximation
    0 references
    \(k\)-\textsc{Center}
    0 references
    highway dimension
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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