scientific article; zbMATH DE number 1303535

From MaRDI portal
Revision as of 17:20, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4250157

zbMath0922.90100MaRDI QIDQ4250157

Madhukar R. Korupolu, Rajmohan Rajaraman, C. Greg Plaxton

Publication date: 18 October 1999


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

New approximation results for resource replication problems, Clustering to minimize the sum of cluster diameters, New approximation algorithms for the unsplittable capacitated facility location problem, Integrality gaps for strengthened linear relaxations of capacitated facility location, A cutting plane algorithm for the capacitated facility location problem, On the bounded-hop MST problem on random Euclidean instances, A branch-and-price algorithm for the capacitated facility location problem, A local search approximation algorithm for \(k\)-means clustering, An approximation algorithm for the \(k\)-level capacitated facility location problem, Approximation algorithms for the fault-tolerant facility location problem with submodular penalties, Recovery guarantees for exemplar-based clustering, Comparison and analysis of ten static heuristics-based Internet data replication techniques, Variations in the flow approach to CFCLP-TC for multiobjective supply chain design, A hybrid firefly-genetic algorithm for the capacitated facility location problem, A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem, On the competitive ratio for online facility location, Facility location models for distribution system design, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems, The Priority k-Median Problem, An Approximation Algorithm for the k-Level Uncapacitated Facility Location Problem with Penalties, Improved approximation algorithms for the facility location problems with linear/submodular penalties, Approximation algorithms for connected facility location problems, Joint object placement and node dimensioning for internet content distribution, An improved approximation algorithm for uncapacitated facility location problem with penalties, A 6.55 factor primal-dual approximation algorithm for the connected facility location problem, An effective heuristic for large-scale capacitated facility location problems, Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem, Applying extra-resource analysis to load balancing., Generalized submodular cover problems and applications, Unnamed Item, Improved approximation algorithms for multilevel facility location problems