Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
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: Fast Routing in Road Networks with Transit Nodes / 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: On subexponential and FPT-time inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / 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: A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coresets for k-means and k-median clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy and hard bottleneck location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Schemes Using Graph Widths / 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

Latest revision as of 01:12, 11 July 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
    4 November 2015
    0 references

    Identifiers

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