Pages that link to "Item:Q287133"

The following pages link to An approximation algorithm for maximum packing of 3-edge paths (Q287133):

Displaying 18 items.

• An approximation algorithm for the maximum traveling salesman problem (Q293334) (← links)
• An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
• A parameterized perspective on packing paths of length two (Q849135) (← links)
• Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
• Approximating the maximum quadratic assignment problem (Q1607075) (← links)
• Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
• A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
• Packing paths: recycling saves time (Q2446295) (← links)
• The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
• An approximation algorithm for maximum triangle packing (Q2492197) (← links)
• Local improvement algorithms for a path packing problem: a performance analysis based on linear programming (Q2661591) (← links)
• Improved Approximation Algorithms for Weighted 2-Path Partitions (Q3452854) (← links)
• Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
• Algorithms – ESA 2004 (Q5464598) (← links)
• A Parameterized Perspective on Packing Paths of Length Two (Q5505643) (← links)
• Approximating the directed path partition problem (Q6204168) (← links)
• Approximation algorithms for the maximum-weight cycle/path packing problems (Q6542868) (← links)
• Improved approximation algorithms for cycle and path packings (Q6575393) (← links)