Path cover problems with length cost

DOI10.1007/978-3-030-96731-4_32OpenAlexW4226144954MaRDI QIDQ2154120FDOQ2154120

Authors: Kenya Kobayashi, Eiji Miyano, Toshiki Saitoh, Akira Suzuki, Tadatoshi Utashima, Tsuyoshi Yagita, Guohui Lin 

Publication date: 13 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-96731-4_32

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Title not available (Why is that?)
• On the Complexity of General Graph Factor Problems
• Complexity of Finding Embeddings in a k-Tree
• Planar Formulae and Their Uses
• The path partition problem and related problems in bipartite graphs
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Nontrivial path covers of graphs: existence, minimization and maximization
• On the \(k\)-path partition of graphs.
• The existence of \(P_{\geq3}\)-factor covered graphs
• A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem
• Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph

Cited In (2)

• Approximation algorithms for covering vertices by long paths
• An approximation algorithm for covering vertices by \(4^+\)-paths

This page was built for publication: Path cover problems with length cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2154120)