Pages that link to "Item:Q1305925"

The following pages link to A constant-factor approximation algorithm for the \(k\)-MST problem (Q1305925):

Displaying 10 items.

• Approximate \(k\)-Steiner forests via the Lagrangian relaxation technique with internal preprocessing (Q848846) (← links)
• Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
• A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems (Q2414116) (← links)
• Pruning 2-connected graphs (Q2428662) (← links)
• Euclidean prize-collecting Steiner forest (Q2429324) (← links)
• Complexity and approximation for traveling salesman problems with profits (Q2441781) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
• A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem (Q2492706) (← links)
• Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem (Q2942405) (← links)
• On the Integrality Gap of the Prize-Collecting Steiner Forest LP (Q5002620) (← links)