Efficient algorithms for the one-dimensional $k$-center problem (Q500977): Difference between revisions

@@ Property / arXiv ID @@
+.7512
@@ Property / arXiv ID: 1301.7512 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for the Continuous/Discrete Weighted 2-Center Problem in Trees
+Normal rank
@@ Property / cites work @@
+Q5452284
@@ Property / cites work: Q5452284 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Algorithms for the Weighted p-Center Problems on the Real Line for Small p
+Normal rank
@@ Property / cites work @@
+THE ALIGNED K-CENTER PROBLEM
@@ Property / cites work: THE ALIGNED K-CENTER PROBLEM / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal slope selection via cuttings
@@ Property / cites work: Optimal slope selection via cuttings / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomially bounded algorithms for locatingp-centers on a tree
+Normal rank
@@ Property / cites work @@
+Fractional cascading. I: A data structuring technique
+Normal rank
@@ Property / cites work @@
+Approximating points by a piecewise linear function
+Normal rank
@@ Property / cites work @@
+A note on searching line arrangements and applications
+Normal rank
@@ Property / cites work @@
+Slowing down sorting networks to obtain faster sorting algorithms
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Two- and Three-Variable Linear Programs
+Normal rank
@@ Property / cites work @@
+A deterministic algorithm for fitting a step function to a weighted point-set
+Normal rank
@@ Property / cites work @@
+Q4037428
@@ Property / cites work: Q4037428 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding kth paths and p-centers by generating and searching good data structures
+Normal rank
@@ Property / cites work @@
+COMPACT INTERVAL TREES: A DATA STRUCTURE FOR CONVEX HULLS
+Normal rank
@@ Property / cites work @@
+Algorithms for finding P-centers on a weighted tree (for relatively small P)
+Normal rank
@@ Property / cites work @@
+An Algorithmic Approach to Network Location Problems. I: The<i>p</i>-Centers
+Normal rank
@@ Property / cites work @@
+Some variations on constrained minimum enclosing circle problem
+Normal rank
@@ Property / cites work @@
+Optimal slope selection via expanders
@@ Property / cites work: Optimal slope selection via expanders / rank @@
+Normal rank
@@ Property / cites work @@
+A Randomized Algorithm for Weighted Approximation of Points by a Step Function
+Normal rank
@@ Property / cites work @@
+Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
+Normal rank
@@ Property / cites work @@
+Linear Programming in Linear Time When the Dimension Is Fixed
+Normal rank
@@ Property / cites work @@
+New Results on the Complexity of <i>p</i>-Centre Problems
+Normal rank
@@ Property / cites work @@
+An $O(n\log ^2 n)$ Algorithm for the <i>k</i>th Longest Path in a Tree with Applications to Location Problems
+Normal rank

Efficient algorithms for the one-dimensional \(k\)-center problem (Q500977): Difference between revisions

Latest revision as of 21:42, 10 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)