The following pages link to Efficient search for rationals (Q1259410):
Displaying 17 items.
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
- Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons (Q834601) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Optimal search for rationals (Q1007565) (← links)
- On search over rationals (Q1170866) (← links)
- Rational search (Q1252036) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- Faster algorithms for quantitative verification in bounded treewidth graphs (Q2058390) (← links)
- Ratio-balanced maximum flows (Q2274503) (← links)
- Finding extrema with unary predicates (Q2366238) (← links)
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games (Q3688122) (← links)
- A finite algorithm for the continuousp-center location problem on a graph (Q3724065) (← links)
- On the non-polynomiality of the relaxation method for systems of linear inequalities (Q3929533) (← links)
- Convergence of a cyclic ellipsoid algorithm for systems of linear equalities (Q3931030) (← links)
- Searching and encoding for infinite ordered sets (Q3933757) (← links)
- On measuring inconsistency in definite and indefinite databases with denial constraints (Q6161468) (← links)
