Time bounds for selection
From MaRDI portal
Publication:1394121
Cites work
Cited in
(only showing first 100 items - show all)- Region-restricted clustering for geographic data mining
- A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
- A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
- Geometric quadrisection in linear time, with application to VLSI placement
- Randomized selection in \(n+C+o(n)\) comparisons
- NP-hard and linear variants of hypergraph partitioning
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines
- A linear time bin-packing algorithm
- An improved algorithm for finding the median distributively
- Upper bounds for time-space trade-offs in sorting and selection
- Efficient selection on a binary tree
- Distributed algorithms for selection in sets
- L-infinity interdistance selection by parametric search
- Optimal parallel selection has complexity O(log log N)
- A Bayesian approach to relevance in game playing
- Determining the mode
- Selection by distributive partitioning
- Efficient searching using partial ordering
- Maintenance of configurations in the plane
- The complexity of selection and ranking in X+Y and matrices with sorted columns
- Bin packing can be solved within 1+epsilon in linear time
- A note on upper bounds for the selection problem
- Hyperbolic 0-1 programming and query optimization in information retrieval
- A linear algorithm for bisecting a polygon
- Finding the \(k\) smallest spanning trees
- Geometric medians
- A heuristic for preemptive scheduling with set-up times
- Simple bounds on the convergence rate of an ergodic Markov chain
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Finding the median
- Sorting by distributive partitioning
- A linear selection algorithm for sets of elements with weights
- On some geometric selection and optimization problems via sorted matrices
- Geometric applications of posets
- Optimal layout of edge-weighted forests
- Robust economic order quantity models
- Restricted center problems under polyhedral gauges
- A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
- Algorithms for parallel memory, I: Two-level memories
- Sorting multisets stably in minimum space
- Incomplete generalized L-statistics
- Bicriteria and restricted 2-facility Weber problems
- Batch RSA
- Approximation algorithms for maximum dispersion
- A more efficient algorithm for MPR problems in phylogeny
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- An approximation scheme for strip packing of rectangles with bounded dimensions
- Illumination by floodlights
- Architecture independent parallel selection with applications to parallel priority queues
- Polynomial time algorithms for three-label point labeling.
- Decomposable multi-parameter matroid optimization problems.
- Lattice-theoretic properties of MPR-posets in phylogeny
- Approximation algorithms for knapsack problems with cardinality constraints
- Algorithms for the parallel alternating direction access machine
- Heaps and heapsort on secondary storage
- Comparator networks for binary heap construction
- A structured family of clustering and tree construction methods
- Selecting small ranks in EREW PRAM
- On characteristics of ancestral character-state reconstructions under the accelerated transformation optimization
- A fast algorithm for the rectilinear distance location problem
- Partial sorting problem on evolving data
- On total \(f\)-domination: polyhedral and algorithmic results
- Finding a given number of solutions to a system of fuzzy constraints
- DC formulations and algorithms for sparse optimization problems
- Optimizing squares covering a set of points
- Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks
- Minimax trees in linear time with applications
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
- Balanced vertex-orderings of graphs
- Robust K-Median and K-means clustering algorithms for incomplete data
- Page-queries as a tool for organizing secondary memory auxiliary databases. II: Optimal selection of SADB contents
- A new linear storage, polynomial-time approximation scheme for the subset-sum problem
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- Continuous bottleneck tree partitioning problems
- Linear sorting with O(log n) processors
- Generating most parsimonious reconstructions on a tree: A generalization of the Farris-Swofford-Maddison method
- Fast deterministic selection on mesh-connected processor arrays
- Finding the n-th largest element
- Algorithms for proximity problems in higher dimensions
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Proportionate progress: A notion of fairness in resource allocation
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- A linear time algorithm for the robust recoverable selection problem
- Computational aspects of the colorful Carathéodory theorem
- On partial sorting in restricted rounds
- Resource allocation problems in decentralized energy management
- New space/time tradeoffs for top-\(k\) document retrieval on sequences
- Multi-dimensional tree guided efficient global association for decomposition-based evolutionary many-objective optimization
- Calibrated model-based evidential clustering using bootstrapping
- A (probably) optimal algorithm for \textsc{bisection} on bounded-treewidth graphs
- Sparse randomized shortest paths routing with Tsallis divergence regularization
- Upper and lower degree-constrained graph orientation with minimum penalty
- Non-convex exact community recovery in stochastic block model
- On the planar two-center problem and circular hulls
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
- Extensions to the Weber problem
- Optimal robust mean and location estimation via convex programs with respect to any pseudo-norms
- String indexing for top-\(k\) close consecutive occurrences
- Linear-time fitting of a \(k\)-step function
- On \(f\)-domination: polyhedral and algorithmic results
This page was built for publication: Time bounds for selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1394121)
