Pages that link to "Item:Q5054807"
From MaRDI portal
The following pages link to The constrained minimum spanning tree problem (Q5054807):
Displayed 32 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Implicit cover inequalities (Q266036) (← links)
- Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← 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)
- 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)
- Approximation algorithms for multi-parameter graph optimization problems (Q1602708) (← 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)
- 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)
- 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)
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle (Q3503853) (← links)
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem (Q3512450) (← links)
- A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem (Q3564143) (← 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)
- Obtaining approximately optimal and diverse solutions via dispersion (Q6109008) (← links)
- On the minimum \(s-t\) cut problem with budget constraints (Q6120941) (← links)
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines (Q6166913) (← links)