Pages that link to "Item:Q5054807"
From MaRDI portal
The following pages link to The constrained minimum spanning tree problem (Q5054807):
Displaying 50 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Implicit cover inequalities (Q266036) (← links)
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem (Q325449) (← links)
- Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705) (← links)
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem (Q342101) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Polynomial time approximation schemes for the constrained minimum spanning tree problem (Q442910) (← links)
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
- Budget constrained minimum cost connected medians (Q876728) (← links)
- The subdivision-constrained minimum spanning tree problem (Q1006063) (← links)
- A polynomial solvable minimum risk spanning tree problem with interval data (Q1027578) (← links)
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
- Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727) (← links)
- A constrained minimum spanning tree problem (Q1571033) (← links)
- Approximation algorithms for multi-parameter graph optimization problems (Q1602708) (← links)
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555) (← links)
- Fast approximation algorithms for computing constrained minimum spanning trees (Q1699768) (← links)
- A theory and algorithms for combinatorial reoptimization (Q1709582) (← links)
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
- Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects (Q2060557) (← links)
- Exact algorithms for finding constrained minimum spanning trees (Q2082219) (← links)
- A randomly weighted minimum spanning tree with a random cost constraint (Q2223477) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- An axiomatic approach in minimum cost spanning tree problems with groups (Q2348765) (← links)
- Approximate spanning cactus (Q2353648) (← links)
- Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910) (← links)
- On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642) (← links)
- Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations (Q2914198) (← links)
- Constrained spanning, Steiner trees and the triangle inequality (Q3407629) (← links)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
- The Minimum Spanning Tree Constraint (Q3524240) (← links)
- A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem (Q3564143) (← links)
- Determining a Minimum Spanning Tree with Disjunctive Constraints (Q3645334) (← links)
- The Minimum Spanning Tree Problem with Time Window Constraints (Q3773692) (← links)
- Optimal Network Design with End-to-End Service Requirements (Q4604906) (← links)
- Facility location with dynamic distance functions (Q5054838) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- A Randomly Weighted Minimum Arborescence with a Random Cost Constraint (Q5085156) (← links)
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem (Q5939585) (← links)
- The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396) (← links)
- On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)
