Pages that link to "Item:Q3549667"

The following pages link to Approximating minimum bounded degree spanning trees to within one of optimal (Q3549667):

Displaying 40 items.

• On some network design problems with degree constraints (Q355516) (← links)
• On generalizations of network design problems with degree bounds (Q378106) (← links)
• Bounded-degree minimum-radius spanning trees in wireless sensor networks (Q391199) (← links)
• New approaches to multi-objective optimization (Q403670) (← links)
• Network design with weighted degree constraints (Q429670) (← links)
• Degree constrained node-connectivity problems (Q486998) (← links)
• Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
• Approximating directed weighted-degree constrained networks (Q627195) (← links)
• Improved approximation algorithms for maximum lifetime problems in wireless networks (Q714776) (← links)
• Network design with edge-connectivity and degree constraints (Q839639) (← links)
• A unified algorithm for degree bounded survivable network design (Q896300) (← links)
• A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
• ILP formulation of the degree-constrained minimum spanning hierarchy problem (Q1631637) (← links)
• Multiple facility location on a network with linear reliability order of edges (Q1680498) (← links)
• Chain-constrained spanning trees (Q1702777) (← links)
• Refuting a conjecture of goemans on bounded degree spanning trees (Q1709958) (← links)
• Spanning tree with lower bound on the degrees (Q1744244) (← links)
• Approximating MIN-cost chain-constrained spanning trees: a reduction from weighted to unweighted problems (Q1800987) (← links)
• \(k\)-trails: recognition, complexity, and approximations (Q1800995) (← links)
• The \((K, k)\)-capacitated spanning tree problem (Q1926491) (← links)
• A computational study on the maximum-weight bounded-degree rooted tree problem (Q2246469) (← links)
• On improved bounds for bounded degree spanning trees for points in arbitrary dimension (Q2250052) (← links)
• An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality (Q2353642) (← links)
• What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
• Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
• Degree bounded matroids and submodular flows (Q2448960) (← links)
• Fast approximation algorithm for maximum lifetime aggregation trees in wireless sensor networks (Q2830947) (← links)
• Iterative Packing for Demand and Hypergraph Matching (Q3009775) (← links)
• Approximating Minimum Cost Source Location Problems with Local Vertex-Connectivity Demands (Q3010423) (← links)
• Network-Design with Degree Constraints (Q3088102) (← links)
• k-Trails: Recognition, Complexity, and Approximations (Q3186496) (← links)
• Approximation-Friendly Discrepancy Rounding (Q3186517) (← links)
• Multi-objective Problems in Terms of Relational Algebra (Q3498407) (← links)
• A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem (Q3541797) (← links)
• Approximating Directed Weighted-Degree Constrained Networks (Q3541798) (← links)
• Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees (Q3602825) (← links)
• Network Design with Weighted Degree Constraints (Q3605498) (← links)
• Approximating Scheduling Machines with Capacity Constraints (Q5321720) (← links)
• (Q5743495) (← links)