Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (Q2424799): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128641678, #quickstatements; #temporary_batch_1730771694739
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963795223 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1801.10416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Purely Additive Fault-Tolerant Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized network design problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms with bounded performance guarantees for the clustered traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the clustered Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding disjoint dense clubs in a social network / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128641678 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:56, 5 November 2024

scientific article
Language Label Description Also known as
English
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
scientific article

    Statements

    Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 2019
    0 references
    clustered shortest-path tree problem
    0 references
    hardness
    0 references
    approximation algorithms
    0 references
    fixed-parameter tractability
    0 references
    network design
    0 references

    Identifiers

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