Pages that link to "Item:Q2492197"

The following pages link to An approximation algorithm for maximum triangle packing (Q2492197):

Displaying 16 items.

• Matching and weighted \(P_2\)-packing: algorithms and kernels (Q393902) (← links)
• On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
• Induced packing of odd cycles in planar graphs (Q764360) (← links)
• A parameterized perspective on packing paths of length two (Q849135) (← links)
• Approximation results for the weighted \(P_4\) partition problem (Q935845) (← links)
• An improved randomized approximation algorithm for maximum triangle packing (Q1028142) (← links)
• Improved approximation algorithms for weighted 2-path partitions (Q1706113) (← links)
• A local search algorithm for binary maximum 2-path partitioning (Q1799391) (← links)
• Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems (Q2354298) (← links)
• Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems (Q2446858) (← links)
• Triangle strings: structures for augmentation of vertex-disjoint triangle sets (Q2448121) (← links)
• Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
• The path partition problem and related problems in bipartite graphs (Q2465958) (← links)
• Packing triangles in low degree graphs and indifference graphs (Q2476287) (← 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)