Pages that link to "Item:Q5501947"

The following pages link to Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947):

Displaying 33 items.

• A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks (Q452816) (← links)
• Self-stabilizing minimum degree spanning tree within one from the optimal degree (Q635330) (← links)
• Degree-bounded minimum spanning tree for unit disk graph (Q764345) (← links)
• A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
• Degree-bounded minimum spanning trees (Q1028423) (← links)
• Approximating bounded-degree spanning trees and connected factors with leaves (Q1728165) (← links)
• Approximation algorithms for connected graph factors of minimum weight (Q1743127) (← links)
• Near-optimal bounded-degree spanning trees (Q1840509) (← links)
• Approximating minimum-cost graph problems with spanning tree edges (Q1892100) (← links)
• The maximum binary tree problem (Q2041978) (← links)
• A unifying model for locally constrained spanning tree problems (Q2045044) (← links)
• Socially fair network design via iterative rounding (Q2084030) (← links)
• Electrical flows over spanning trees (Q2097649) (← links)
• The generalized dependency constrained spanning tree problem (Q2132411) (← links)
• On approximating degree-bounded network design problems (Q2134742) (← links)
• Towards tight(er) bounds for the excluded grid theorem (Q2221926) (← links)
• Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
• Routing in undirected graphs with constant congestion (Q2817791) (← links)
• Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
• Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints (Q3452817) (← links)
• SINGLE-SOURCE DILATION-BOUNDED MINIMUM SPANNING TREES (Q3459364) (← links)
• Approximating Minimum Max-Stretch Spanning Trees on Unweighted Graphs (Q3642863) (← links)
• (Q4286079) (← links)
• Thin trees in some families of distance-regular graphs (Q4965921) (← links)
• A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
• Quasi-Popular Matchings, Optimality, and Extended Formulations (Q5076707) (← links)
• Exact Algorithms for the Minimum Load Spanning Tree Problem (Q5084607) (← links)
• A Spectral Approach to Network Design (Q5092510) (← links)
• The Maximum Binary Tree Problem. (Q5874498) (← links)
• Approximate multi-matroid intersection via iterative refinement (Q5918919) (← links)
• Reconfiguration of spanning trees with degree constraints or diameter constraints (Q6053473) (← links)
• On approximating degree-bounded network design problems (Q6084395) (← links)
• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems (Q6564769) (← links)