Pages that link to "Item:Q1119596"

The following pages link to An application of submodular flows (Q1119596):

Displaying 26 items.

• Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
• Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
• Degree constrained node-connectivity problems (Q486998) (← links)
• Approximating source location and star survivable network problems (Q528470) (← links)
• Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
• Power optimization for connectivity problems (Q877193) (← links)
• On minimum power connectivity problems (Q972357) (← links)
• Rooted \(k\)-connections in digraphs (Q1025990) (← links)
• Approximating minimum-power edge-covers and 2,3-connectivity (Q1026146) (← links)
• Generalized polymatroids and submodular flows (Q1116889) (← links)
• Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
• Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
• Power assignment for \(k\)-connectivity in wireless ad hoc networks (Q1781807) (← links)
• Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
• A \(4+\epsilon\) approximation for \(k\)-connected subgraphs (Q2237891) (← links)
• Relay placement for two-connectivity (Q2339829) (← links)
• Approximating subset \(k\)-connectivity problems (Q2376789) (← links)
• Approximating node-connectivity augmentation problems (Q2429349) (← links)
• Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
• Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
• A Survey on Covering Supermodular Functions (Q2971606) (← links)
• Approximating Survivable Networks with Minimum Number of Steiner Points (Q3075458) (← links)
• Better algorithms for minimum weight vertex-connectivity problems (Q5048953) (← links)
• Approximation algorithms for graph augmentation (Q5204328) (← links)
• Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings (Q5219667) (← links)
• Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)