Pages that link to "Item:Q877193"
From MaRDI portal
The following pages link to Power optimization for connectivity problems (Q877193):
Displaying 18 items.
- Survivable network activation problems (Q386909) (← links)
- Approximating minimum power edge-multi-covers (Q498430) (← links)
- Approximating minimum-power degree and connectivity problems (Q547290) (← links)
- Improved approximation algorithms for label cover problems (Q634686) (← links)
- On minimum power connectivity problems (Q972357) (← links)
- Approximating minimum power covers of intersecting families and directed edge-connectivity problems (Q974743) (← links)
- Wireless network design via 3-decompositions (Q990943) (← links)
- Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
- The connected Vietoris powerlocale (Q1030196) (← links)
- Approximating activation edge-cover and facility location problems (Q2166781) (← links)
- Approximate min-power strong connectivity (Q2870520) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- (Q5092379) (← links)
- Approximating Steiner Networks with Node Weights (Q5458547) (← links)
- Improved approximation algorithms for minimum power covering problems (Q5919677) (← links)
- 1.61-approximation for min-power strong connectivity with two power levels (Q5963620) (← links)
- Minimum shared‐power edge cut (Q6066053) (← links)
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths (Q6663517) (← links)