Pages that link to "Item:Q1161291"
From MaRDI portal
The following pages link to The complexity of selection and ranking in X+Y and matrices with sorted columns (Q1161291):
Displayed 50 items.
- Covering a set of points by two axis-parallel boxes (Q294806) (← links)
- Optimal eviction policies for stochastic address traces (Q386897) (← links)
- Necklaces, convolutions, and \(X+Y\) (Q517795) (← links)
- An algorithm for a separable integer programming problem with cumulatively bounded variables (Q579126) (← links)
- On an optimization problem with nested constraints (Q583110) (← links)
- Representing a functional curve by curves with fewer peaks (Q635753) (← links)
- An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (Q675985) (← links)
- An efficient implementation of priority queues using fixed-sized systolic coprocessors (Q685514) (← links)
- Selection in \(X+Y\) and matrices with sorted rows and columns (Q761793) (← links)
- A fast algorithm for the linear multiple-choice knapsack problem (Q800227) (← links)
- Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
- Dynamic layers of maxima with applications to dominating queries (Q827327) (← links)
- Ranking \(k\) maximum sums (Q884477) (← links)
- Range queries on uncertain data (Q897858) (← links)
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Geometric pattern matching for point sets in the plane under similarity transformations (Q989531) (← links)
- Dynamic ham-sandwich cuts in the plane (Q1025301) (← links)
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- Distributed algorithms for selection in sets (Q1112607) (← links)
- L-infinity interdistance selection by parametric search (Q1115620) (← links)
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region (Q1179000) (← links)
- An algorithm for the fair resource allocation problem with a submodular constraint (Q1179783) (← links)
- A distributed selection algorithm and its expected communication complexity (Q1193632) (← links)
- On the parallel-decomposability of geometric problems (Q1194344) (← links)
- Finding the closest extreme vertex to a fixed point (Q1199551) (← links)
- On some geometric selection and optimization problems via sorted matrices (Q1265327) (← links)
- Optimal binary trees with order constraints (Q1283811) (← links)
- An optimal parallel algorithm for merging using multiselection (Q1322118) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- A short proof of optimality of the bottom up algorithm for discrete resource allocation problems (Q1373462) (← links)
- Algorithms for the item assortment problem: an application to vending machine products (Q1394572) (← links)
- Improved algorithms for several network location problems with equality measures. (Q1408453) (← links)
- Kinetic \(k\)-semi-Yao graph and its applications (Q1622343) (← links)
- Algorithms for separable convex optimization with linear ascending constraints (Q1628287) (← links)
- Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling (Q1663138) (← links)
- Optimizing squares covering a set of points (Q1749537) (← links)
- The algebraic Monge property and path problems (Q1765525) (← links)
- A nonlinear knapsack problem (Q1905070) (← links)
- Scheduling with gaps: new models and algorithms (Q2059088) (← links)
- Finding axis-parallel rectangles of fixed perimeter or area containing the largest number of points (Q2331206) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking (Q2355889) (← links)
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952) (← links)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- One-way and round-trip center location problems (Q2568335) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- Matching sets of line segments (Q2662685) (← links)