Pages that link to "Item:Q1135201"

The following pages link to Easy and hard bottleneck location problems (Q1135201):

Displaying 50 items.

• Kinetic clustering of points on the line (Q301594) (← links)
• Graph clustering (Q458448) (← links)
• The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• Fixed-parameter approximations for \(k\)-center problems in low highway dimension graphs (Q666662) (← links)
• On worst-case aggregation analysis for network location problems (Q689246) (← links)
• A simple heuristic for the p-centre problem (Q761233) (← links)
• Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
• A heuristic for the p-center problem in graphs (Q1098862) (← links)
• Analytical models for locating undesirable facilities (Q1118522) (← links)
• Locational analysis (Q1173002) (← links)
• Special issue on Locational analysis (Q1284594) (← links)
• Location of rectilinear center trajectories (Q1284595) (← links)
• Fault tolerant \(K\)-center problems (Q1575549) (← links)
• Obstructions to a small hyperbolicity in Helly graphs (Q1625787) (← links)
• Improved approximation algorithms for capacitated fault-tolerant \(k\)-center (Q1742378) (← links)
• A new compact formulation for the discrete \(p\)-dispersion problem (Q1752169) (← links)
• \(k\)-center problems with minimum coverage (Q1770377) (← links)
• Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs (Q1799228) (← links)
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (Q2072077) (← links)
• The weighted \(k\)-center problem in trees for fixed \(k\) (Q2077394) (← links)
• Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making (Q2097653) (← links)
• A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
• Fair colorful \(k\)-center clustering (Q2118132) (← links)
• Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
• Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs (Q2185812) (← links)
• Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
• Reverse greedy is bad for \(k\)-center (Q2308462) (← links)
• An adaptive probabilistic algorithm for online \(k\)-center clustering (Q2313750) (← links)
• The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
• On interval and circular-arc covering problems (Q2327673) (← links)
• Asymmetric \(k\)-center with minimum coverage (Q2380063) (← links)
• Client assignment problems for latency minimization (Q2424655) (← links)
• On clustering with discounts (Q2671820) (← links)
• Approximability results for the converse connected<i>p</i>-centre problem^† (Q2958261) (← links)
• Insertion heuristics for central cycle problems (Q3057168) (← links)
• Fixed Parameter Approximations for k-Center Problems in Low Highway Dimension Graphs (Q3449507) (← links)
• (Q3783313) (← links)
• (Q3800086) (← links)
• Recent Developments in Approximation Algorithms for Facility Location and Clustering Problems (Q4689624) (← links)
• A Lottery Model for Center-Type Problems With Outliers (Q4972682) (← links)
• Generalized Center Problems with Outliers (Q4972687) (← links)
• A Lottery Model for Center-Type Problems with Outliers (Q5002613) (← links)
• (Q5002700) (← links)
• (Q5002778) (← links)
• A Technique for Obtaining True Approximations for k-Center with Covering Constraints (Q5041734) (← links)
• Fair Colorful k-Center Clustering (Q5041747) (← links)
• Facility location with dynamic distance functions (Q5054838) (← links)
• (Q5075746) (← links)