Approximating the directed path partition problem (Q6204168): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On Local Search for Weighted <i>k</i>-Set Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: 8/7-approximation algorithm for (1,2)-TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing paths: recycling saves time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the test cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local improvement algorithms for a path packing problem: a performance analysis based on linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms and hardness results for the clique packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for packing and covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the minimum 3-path partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 21/16-Approximation for the Minimum 3-Path Partition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5272625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized perspective on packing paths of length two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum skew-symmetric flows and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for maximum packing of 3-edge paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of General Graph Factor Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings by cliques and by finite families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Systems of Sets Every <i>t</i> of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A boundary class for the \(k\)-path partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path partition problem and related problems in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(k\)-path partition of graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star Partitions of Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the asymmetric travelling salesman problem with distances one and two / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-path partitions in trees / rank
 
Normal rank

Revision as of 10:05, 29 August 2024

scientific article; zbMATH DE number 7825553
Language Label Description Also known as
English
Approximating the directed path partition problem
scientific article; zbMATH DE number 7825553

    Statements

    Approximating the directed path partition problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 March 2024
    0 references
    path partition
    0 references
    digraph
    0 references
    alternating walk
    0 references
    enlarging walk
    0 references
    path-cycle cover
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers