Pages that link to "Item:Q4895812"

The following pages link to Improved Approximation Algorithms for Uniform Connectivity Problems (Q4895812):

Displaying 24 items.

• Improved approximation algorithms for single-tiered relay placement (Q266064) (← links)
• Performance guarantees for the TSP with a parameterized triangle inequality (Q294711) (← links)
• Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
• Degree constrained node-connectivity problems (Q486998) (← links)
• An improved approximation algorithm for the minimum cost subset \(k\)-connected subgraph problem (Q494800) (← links)
• Relay placement for fault tolerance in wireless networks in higher dimensions (Q632722) (← links)
• An approximation algorithm for minimum-cost vertex-connectivity problems (Q679445) (← links)
• Power optimization for connectivity problems (Q877193) (← links)
• On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
• Faster approximation algorithms for weighted triconnectivity augmentation problems (Q1267191) (← links)
• Improved approximation algorithms for minimum cost node-connectivity augmentation problems (Q1635806) (← links)
• Approximating Steiner trees and forests with minimum number of Steiner points (Q1796259) (← links)
• Approximating unweighted connectivity problems in parallel (Q1854474) (← 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)
• Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems (Q2496319) (← links)
• Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design (Q2949211) (← links)
• Approximating the smallest <i>k</i> -edge connected spanning subgraph by LP-rounding (Q3057092) (← links)
• Approximating Steiner Trees and Forests with Minimum Number of Steiner Points (Q3453286) (← links)
• Improved Approximation Algorithms for Min-Cost Connectivity Augmentation Problems (Q5740195) (← links)
• (Q5743495) (← links)
• On a partition LP relaxation for min-cost 2-node connected spanning subgraphs (Q6106538) (← links)
• An improvement on Łuczak's connected matchings method (Q6133269) (← links)