Pages that link to "Item:Q679454"

The following pages link to An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454):

Displaying 8 items.

• Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382) (← links)
• Revisiting dynamic programming for finding optimal subtrees in trees (Q856203) (← links)
• The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
• New metaheuristic approaches for the edge-weighted \(k\)-cardinality tree problem (Q1764754) (← links)
• Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
• The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem (Q2434979) (← links)
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)