Pages that link to "Item:Q3512428"

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 (Q3512428):

Displaying 50 items.

• The generalized assignment problem with minimum quantities (Q257215) (← links)
• Combinatorial approximation algorithms for the robust facility location problem with penalties (Q280977) (← links)
• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
• Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← links)
• Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs (Q328705) (← links)
• Deterministic versus randomized adaptive test cover (Q329717) (← links)
• Finding a collective set of items: from proportional multirepresentation to group recommendation (Q334810) (← links)
• Clustering through continuous facility location problems (Q346248) (← links)
• Towards the price of leasing online (Q346515) (← links)
• On a facility location problem with applications to tele-diagnostic (Q360498) (← links)
• An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties (Q384185) (← links)
• The \(l\)-diversity problem: tractability and approximability (Q392037) (← links)
• A probabilistic PTAS for shortest common superstring (Q393897) (← links)
• Multi-pattern matching with bidirectional indexes (Q396713) (← links)
• An approximation algorithm for the dynamic facility location problem with submodular penalties (Q403471) (← links)
• A polylogarithmic approximation for computing non-metric terminal Steiner trees (Q407565) (← links)
• Combinatorial model and bounds for target set selection (Q410735) (← links)
• Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms (Q411835) (← links)
• A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs (Q418750) (← links)
• Repairing XML functional dependency violations (Q424778) (← links)
• Information-theoretic approaches to branching in search (Q429675) (← links)
• On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
• Improved approximation algorithms for the robust fault-tolerant facility location problem (Q436327) (← links)
• Graph clustering (Q458448) (← links)
• A survey on the structure of approximation classes (Q458503) (← links)
• Selfish splittable flows and NP-completeness (Q465681) (← links)
• Finding the closest ultrametric (Q476304) (← links)
• Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach (Q476861) (← links)
• Comments on the hierarchically structured bin packing problem (Q477673) (← links)
• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
• A cost-sharing method for an uncapacitated facility location game with penalties (Q488891) (← links)
• Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
• LP-rounding algorithms for the fault-tolerant facility placement problem (Q491622) (← links)
• Correcting gene tree by removal and modification: tractability and approximability (Q491623) (← links)
• Inapproximability results for graph convexity parameters (Q496002) (← links)
• The capacitated orienteering problem (Q496434) (← links)
• Improved and simplified inapproximability for \(k\)-means (Q506167) (← links)
• Robust ordinal regression for dominance-based rough set approach to multiple criteria sorting (Q508603) (← links)
• On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
• Continuous speed scaling with variability: a simple and direct approach (Q526899) (← links)
• A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
• Capacitated domination problem (Q534769) (← links)
• Multi-facility ordered median problems in directed networks (Q545449) (← links)
• Video distribution under multiple constraints (Q551203) (← links)
• Matching interdiction (Q602686) (← links)
• Grouping objects in multi-band images using an improved eigenvector-based algorithm (Q604192) (← links)
• Incremental facility location problem and its competitive algorithms (Q604759) (← links)
• An approximation algorithm for the \(k\)-level stochastic facility location problem (Q613331) (← links)
• An approximation algorithm for the \(k\)-level capacitated facility location problem (Q613660) (← links)