The following pages link to Many birds with one stone (Q5248513):
Displaying 41 items.
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- Network design with weighted degree constraints (Q429670) (← links)
- Simultaneous approximation of multi-criteria submodular function maximization (Q489121) (← links)
- Bi-objective matchings with the triangle inequality (Q515541) (← links)
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle (Q543415) (← links)
- Approximating directed weighted-degree constrained networks (Q627195) (← links)
- Approximating some network design problems with node costs (Q638508) (← links)
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
- Optimizing cost flows by edge cost and capacity upgrade (Q876725) (← links)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- Data aggregation in sensor networks: Balancing communication and delay costs (Q1008733) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- Stack-up algorithms for palletizing at delivery industry (Q1592737) (← links)
- ILP formulation of the degree-constrained minimum spanning hierarchy problem (Q1631637) (← links)
- Refuting a conjecture of goemans on bounded degree spanning trees (Q1709958) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- Euclidean bottleneck bounded-degree spanning tree ratios (Q2066315) (← links)
- Socially fair network design via iterative rounding (Q2084030) (← links)
- On approximating degree-bounded network design problems (Q2134742) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← links)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
- Competitive algorithms for the bicriteria \(k\)-server problem (Q2433801) (← links)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- Sublogarithmic approximation for telephone multicast (Q2495404) (← links)
- Bulk-robust combinatorial optimization (Q2515045) (← links)
- Efficiently computing succinct trade-off curves (Q2581275) (← links)
- Multi-objective Problems in Terms of Relational Algebra (Q3498407) (← links)
- Approximating Directed Weighted-Degree Constrained Networks (Q3541798) (← links)
- Network Design with Weighted Degree Constraints (Q3605498) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees (Q4360134) (← links)
- The constrained minimum spanning tree problem (Q5054807) (← links)
- On the approximability of some maximum spanning tree problems (Q5096340) (← links)
- Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal (Q5501947) (← links)
- Compact location problems with budget and communication constraints (Q6064048) (← links)
- On approximating degree-bounded network design problems (Q6084395) (← links)
- The multi-weighted spanning tree problem (Q6085702) (← links)
- Modifying networks to obtain low cost trees (Q6550552) (← links)
