Pages that link to "Item:Q2003407"

The following pages link to Linear programming in \(O(n\times 3^{d^2})\) time (Q2003407):

Displaying 12 items.

• Weighted search in the plane (Q673472) (← links)
• Algorithms for weak and wide separation of sets (Q686422) (← links)
• Linear time algorithms for some separable quadratic programming problems (Q688207) (← links)
• Small-dimensional linear programming and convex hulls made easy (Q1176319) (← links)
• Cutting hyperplanes for divide-and-conquer (Q1209837) (← links)
• On the ball spanned by balls (Q1264087) (← links)
• Characterizing multiterminal flow networks and computing flows in networks of small treewidth (Q1278042) (← links)
• Decomposable multi-parameter matroid optimization problems. (Q1401298) (← links)
• Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
• Average complexity of a gift-wrapping algorithm for determining the convex hull of randomly given points (Q2365326) (← links)
• A polynomial algorithm for a continuous bilevel knapsack problem (Q2417096) (← links)
• Two-variable linear programming in parallel (Q5054853) (← links)