Pages that link to "Item:Q1899219"
From MaRDI portal
The following pages link to Balancing minimum spanning trees and shortest-path trees (Q1899219):
Displaying 35 items.
- Approximating capacitated tree-routings in networks (Q630195) (← links)
- LP-based approximation algorithms for facility location in buy-at-bulk network design (Q666665) (← links)
- Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (Q845678) (← links)
- On the approximation of the generalized capacitated tree-routing problem (Q988692) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- Spanning trees and shortest paths in Monge graphs (Q1382772) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- Delay-related secondary objectives for rectilinear Steiner minimum trees. (Q1427185) (← links)
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks (Q1662512) (← links)
- Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology (Q1709982) (← links)
- Approximating the \(k\)-splittable capacitated network design problem (Q1751198) (← links)
- The non-approximability of bicriteria network design problems (Q1827279) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- Electrical flows over spanning trees (Q2097649) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- An improved approximation algorithm for the uniform cost-distance Steiner tree problem (Q2117699) (← links)
- Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
- Minimizing the sum of distances to a server in a constraint network (Q2330034) (← links)
- Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
- Terminal embeddings (Q2405893) (← links)
- Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
- On additive spanners in weighted graphs with local error (Q2672448) (← links)
- Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE (Q3166749) (← links)
- LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design (Q3449835) (← links)
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134) (← links)
- Light graphs with small routing cost (Q4537619) (← links)
- MIXED SPANNING TREES IN THEORY AND PRACTICE (Q4949992) (← links)
- Clifford algebra method for network expression, computation, and algorithm construction (Q5170222) (← links)
- Approximation Algorithms for Key Management in Secure Multicast (Q5323059) (← links)
- Approximation to the Minimum Cost Edge Installation Problem (Q5387765) (← links)
- The cable trench problem: Combining the shortest path and minimum spanning tree problems (Q5959396) (← links)
- Advanced network connectivity features and zonal requirements in covering location problems (Q6047840) (← links)
- On the complexity of the cable-trench problem (Q6048437) (← links)
