Pages that link to "Item:Q4406291"

The following pages link to Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation (Q4406291):

Displaying 26 items.

• The saga of minimum spanning trees (Q458468) (← links)
• A fast minimum spanning tree algorithm based on \(K\)-means (Q527132) (← links)
• Approximation algorithms for the priority facility location problem with penalties (Q905151) (← links)
• The bridge-connectivity augmentation problem with a partition constraint (Q982661) (← links)
• Computing and minimizing the relative regret in combinatorial optimization with interval data (Q1019293) (← links)
• Graph summarization with quality guarantees (Q1741300) (← links)
• Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
• An approximation algorithm for stochastic multi-level facility location problem with soft capacities (Q2082185) (← links)
• An approximation algorithm for the uniform capacitated \(k\)-means problem (Q2082194) (← links)
• An approximation algorithm for the spherical \(k\)-means problem with outliers by local search (Q2084618) (← links)
• An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
• Improved parameterized approximation for balanced \(k\)-median (Q2150584) (← links)
• Approximation algorithm with constant ratio for stochastic prize-collecting Steiner tree problem (Q2165784) (← links)
• Clustering with or without the approximation (Q2377383) (← links)
• On the parallel computation of the biconnected and strongly connected co-components of graphs (Q2383544) (← links)
• A 2-approximation NC algorithm for connected vertex cover and tree cover (Q2390219) (← links)
• An approximation algorithm for the \(k\)-median warehouse-retailer network design problem (Q2441152) (← links)
• Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
• On the Strongly Connected and Biconnected Components of the Complement of Graphs (Q3439158) (← links)
• Graph Connectivity in Log Steps Using Label Propagation (Q5087066) (← links)
• Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
• Integrated Supply Chain Management via Randomized Rounding (Q5131715) (← links)
• (Q5874506) (← links)
• Approximating node-weighted \(k\)-MST on planar graphs (Q5918856) (← links)
• Deterministic Massively Parallel Connectivity (Q6069413) (← links)
• Time-optimal construction of overlay networks (Q6096036) (← links)