The following pages link to (Q4471308):
Displayed 27 items.
- Graphs with large generalized (edge-)connectivity (Q339485) (← links)
- A solution to a conjecture on the generalized connectivity of graphs (Q512887) (← links)
- Packing Steiner trees on four terminals (Q602710) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Packing directed cycles efficiently (Q867851) (← links)
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) (← links)
- Galois geometries and coding theory (Q908053) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs (Q958684) (← links)
- Packing trees in communication networks (Q1016048) (← links)
- Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072) (← links)
- On the approximability of robust network design (Q1998836) (← links)
- Greedy algorithms for the profit-aware social team formation problem (Q2168713) (← links)
- On fractional cut covers (Q2312658) (← links)
- Packing Steiner trees with identical terminal sets (Q2390272) (← links)
- Biclique completion problems for multicast network design (Q2427696) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
- Approximating the two-level facility location problem via a quasi-greedy approach (Q2494518) (← links)
- Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753) (← links)
- Disjoint bases in a polymatroid (Q3055784) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- Edge disjoint Steiner trees in graphs without large bridges (Q3652550) (← links)
- (Q5002841) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- The Complexity of Contracts (Q5856150) (← links)
- Resource time-sharing for IoT applications with deadlines (Q6112000) (← links)