Pages that link to "Item:Q3032100"
From MaRDI portal
The following pages link to Approximation algorithms for covering a graph by vertex-disjoint paths of maximum total weight (Q3032100):
Displaying 14 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- On the asymptotic optimality of a solution of the Euclidean problem of covering a graph by \(m\) nonadjacent cycles of maximum total weight (Q294361) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- Exact algorithms for the maximum dissociation set and minimum 3-path vertex cover problems (Q507444) (← links)
- Path-matching problems (Q1193516) (← links)
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two (Q1209363) (← links)
- Covering a graph with nontrivial vertex-disjoint paths: existence and optimization (Q1627174) (← links)
- Path covering problems and testing of printed circuits (Q1900134) (← links)
- Approximation algorithms for minimum weight connected 3-path vertex cover (Q2008557) (← links)
- A complexity and approximation framework for the maximization scaffolding problem (Q2354768) (← links)
- Approximating maximum weight cycle covers in directed graphs with weights zero and one (Q2483998) (← links)
- (Q4369618) (← links)
- An Adaptive Multigrid Method Based on Path Cover (Q5241251) (← links)
- Approximating the directed path partition problem (Q6204168) (← links)
