Q5009490 (Q5009490): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Practical access to dynamic programming on tree decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jdrasil: A Modular Library for Computing Tree Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing tree width: from theory to practice and back / 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: Computation and growth of road network dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth / 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: The Steiner tree problem on graphs: inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer set solving with bounded treewidth revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: DynASP2.5: Dynamic Programming on Tree Decompositions in Action / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting treewidth for projected model counting and its limits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4634396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-encodings for special treewidth and pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Bounds for Graph Steiner Tree Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the kernel for planar Steiner tree to the number of Steiner vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive-Instance Driven Dynamic Programming for Treewidth. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing treewidth on the GPU / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions / rank
 
Normal rank

Revision as of 07:46, 26 July 2024

scientific article; zbMATH DE number 7378612
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7378612

    Statements

    0 references
    0 references
    4 August 2021
    0 references
    Steiner tree problem
    0 references
    contest
    0 references
    implementation challenge
    0 references
    FPT
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers