The constrained minimum spanning tree problem
From MaRDI portal
Recommendations
- An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
- Fast approximation algorithms for computing constrained minimum spanning trees
- Exact algorithms for finding constrained minimum spanning trees
- Polynomial time approximation schemes for the constrained minimum spanning tree problem
- The subdivision-constrained minimum spanning tree problem
Cites work
- A data structure for dynamic trees
- An application of lagrangean decomposition to the resource-constrained minimum weighted arborescence problem
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- scientific article; zbMATH DE number 437570 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- Many birds with one stone
- New Parallel-Sorting Schemes
Cited in
(64)- The subdivision-constrained minimum spanning tree problem
- A polynomial solvable minimum risk spanning tree problem with interval data
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption
- Edge exchanges in the degree-constrained minimum spanning tree problem
- Modifying edges of a network to obtain short subgraphs
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem.
- A constrained minimum spanning tree problem
- Approximation algorithms for multi-parameter graph optimization problems
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
- Fast approximation algorithms for computing constrained minimum spanning trees
- A theory and algorithms for combinatorial reoptimization
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects
- Exact algorithms for finding constrained minimum spanning trees
- An exact algorithm for multi-constrained minimum spanning tree problem
- A randomly weighted minimum spanning tree with a random cost constraint
- Degree bounded bottleneck spanning trees in three dimensions
- An axiomatic approach in minimum cost spanning tree problems with groups
- Approximate spanning cactus
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- On the set of extreme core allocations for minimal cost spanning tree problems
- Competitive algorithms for the bicriteria \(k\)-server problem
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- Bulk-robust combinatorial optimization
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
- Implicit cover inequalities
- On Lagrangian relaxation for constrained maximization and reoptimization problems
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- A strong symmetric formulation for the min-degree constrained minimum spanning tree problem
- Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs
- Constrained spanning, Steiner trees and the triangle inequality
- The minimum weight spanning tree with constraints
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- Bicriteria Approximation Tradeoff for the Node-Cost Budget Problem
- The Minimum Spanning Tree Constraint
- A Lagrangian-based algorithm for a combinatorial motion planning problem
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- The Minimum Spanning Tree Problem with Time Window Constraints
- Designing a minimal spanning tree network subject to a budget constraint
- New approaches to multi-objective optimization
- Polynomial time approximation schemes for the constrained minimum spanning tree problem
- Optimal network design with end-to-end service requirements
- An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection
- An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem
- scientific article; zbMATH DE number 1439455 (Why is no real title available?)
- Facility location with dynamic distance functions
- Approximation Methods for Multiobjective Optimization Problems: A Survey
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- A randomly weighted minimum arborescence with a random cost constraint
- Contractors' minimum spanning tree
- A new dynamic programming approach for spanning trees with chain constraints and beyond
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- The cable trench problem: Combining the shortest path and minimum spanning tree problems
- Obtaining approximately optimal and diverse solutions via dispersion
- On the minimum \(s-t\) cut problem with budget constraints
- Polynomial-time approximation schemes for a class of integrated network design and scheduling problems with parallel identical machines
- Modifying networks to obtain low cost trees
- Lower bounds for matroid optimization problems with a linear constraint
- Budgeted matroid maximization: a parameterized viewpoint
- Note on polynomial-time approximation schemes for integrated network design and scheduling problems
- New results on a general class of minimum norm optimization problems
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications
- Budget constrained minimum cost connected medians
This page was built for publication: The constrained minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054807)
