Pages that link to "Item:Q3149894"
From MaRDI portal
The following pages link to A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees (Q3149894):
Displaying 27 items.
- Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Bounded-degree minimum-radius spanning trees in wireless sensor networks (Q391199) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Approximating directed weighted-degree constrained networks (Q627195) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- Chain-constrained spanning trees (Q1702777) (← links)
- Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Electrical flows over spanning trees (Q2097649) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- On Lagrangian relaxation for constrained maximization and reoptimization problems (Q2664005) (← links)
- Design and Analysis of Optimization Algorithms Using Computational Statistics (Q3159469) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- Approximating Directed Weighted-Degree Constrained Networks (Q3541798) (← links)
- On Lagrangian Relaxation and Subset Selection Problems (Q3602837) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- (Q5743495) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- On approximating degree-bounded network design problems (Q6084395) (← links)
