Pages that link to "Item:Q4651480"
From MaRDI portal
The following pages link to Local Search Heuristics for <i>k</i>-Median and Facility Location Problems (Q4651480):
Displayed 50 items.
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
- A lower bound for metric 1-median selection (Q340556) (← links)
- On a facility location problem with applications to tele-diagnostic (Q360498) (← links)
- A 3-approximation algorithm for the facility location problem with uniform capacities (Q378101) (← links)
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Data stability in clustering: a closer look (Q465252) (← links)
- LP-rounding algorithms for the fault-tolerant facility placement problem (Q491622) (← links)
- Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
- One-dimensional \(k\)-center on uncertain data (Q497686) (← links)
- A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
- Capacitated domination problem (Q534769) (← links)
- On min-max \(r\)-gatherings (Q627109) (← links)
- Better bounds for incremental medians (Q627114) (← links)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median (Q666661) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme (Q724755) (← links)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← links)
- Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
- Recovery guarantees for exemplar-based clustering (Q897656) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- An approximation ratio for biclustering (Q975394) (← links)
- Complexity of single-swap heuristics for metric facility location and related problems (Q1628593) (← links)
- An approximation algorithm for the \(k\)-median problem with uniform penalties via pseudo-solution (Q1630998) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← links)
- An improved approximation algorithm for the \(k\)-level facility location problem with soft capacities (Q1690580) (← links)
- A local search approximation algorithm for the uniform capacitated \(k\)-facility location problem (Q1702823) (← links)
- Graph summarization with quality guarantees (Q1741300) (← links)
- Approximation algorithms for the robust facility leasing problem (Q1749787) (← links)
- Approximation algorithms for the fault-tolerant facility placement problem (Q1944947) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Local search algorithm for the squared metric \(k\)-facility location problem with linear penalties (Q1983746) (← links)
- Faster balanced clusterings in high dimension (Q2006774) (← links)
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations (Q2019514) (← links)
- Approximating the \(\tau\)-relaxed soft capacitated facility location problem (Q2023133) (← links)
- Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
- Approximation algorithms for the lower-bounded knapsack median problem (Q2039651) (← links)
- Improved approximation for prize-collecting red-blue median (Q2043014) (← links)
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties (Q2045029) (← links)
- An approximation algorithm for the \(k\)-level facility location problem with outliers (Q2047198) (← links)
- Near-optimal large-scale k-medoids clustering (Q2054038) (← links)
- An approximation algorithm for stochastic multi-level facility location problem with soft capacities (Q2082185) (← links)
- GravCPA: controller placement algorithm based on traffic gravitation in SDN (Q2084493) (← links)
- Improved approximation algorithms for solving the squared metric \(k\)-facility location problem (Q2110368) (← links)
- A tight analysis of geometric local search (Q2117344) (← links)
- To close is easier than to open: dual parameterization to \(k\)-median (Q2117693) (← links)
- Problem-based optimal scenario generation and reduction in stochastic programming (Q2118075) (← links)
- Scenario reduction revisited: fundamental limits and guarantees (Q2118076) (← links)
- An improved approximation algorithm for squared metric \(k\)-facility location (Q2150578) (← links)
- Improved parameterized approximation for balanced \(k\)-median (Q2150584) (← links)
- An improved \((1+1)\) evolutionary algorithm for \(k\)-Median clustering problem with performance guarantee (Q2164835) (← links)