The following pages link to Leonid G. Khachiyan (Q1315410):
Displaying 50 items.
- (Q845918) (redirect page) (← links)
- (Q1114593) (redirect page) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation (Q860396) (← links)
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory (Q867855) (← links)
- An inequality for the volume of inscribed ellipsoids (Q909241) (← links)
- Generating cut conjunctions in graphs and related problems (Q930604) (← links)
- Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions (Q943838) (← links)
- A certain inequality for convex forms (Q1114594) (← links)
- On the conductance of order Markov chains (Q1182035) (← links)
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope (Q1315411) (← links)
- A greedy heuristic for a minimum-weight forest problem (Q1317004) (← links)
- On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms (Q1318656) (← links)
- On the complexity of approximating extremal determinants in matrices (Q1346597) (← links)
- On the frequency of the most frequently occurring variable in dual monotone DNFs (Q1357747) (← links)
- On the complexity of semidefinite programs (Q1361073) (← links)
- Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time (Q1363422) (← links)
- (Q1404407) (redirect page) (← links)
- On maximal frequent and minimal infrequent sets in binary matrices (Q1404408) (← links)
- An inequality for polymatroid functions and its applications. (Q1410680) (← links)
- Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices (Q1424303) (← links)
- Dual-bounded generating problems: Weighted transversals of a hypergraph (Q1878396) (← links)
- Diagonal matrix scaling is NP-hard (Q1908195) (← links)
- On the complexity of nonnegative-matrix scaling (Q1915608) (← links)
- A sublinear-time randomized approximation algorithm for matrix games (Q1919166) (← links)
- On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions (Q1961461) (← links)
- Integer optimization on convex semialgebraic sets (Q1971505) (← links)
- Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data (Q2373724) (← links)
- On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs (Q2381526) (← links)
- Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph (Q2719122) (← links)
- Approximate Max-Min Resource Sharing for Structured Concave Optimization (Q2719242) (← links)
- (Q2754179) (← links)
- (Q2768039) (← links)
- (Q2920268) (← links)
- The problem of calculating the volume of a polyhedron is enumerably hard (Q3034820) (← links)
- (Q3042881) (← links)
- (Q3048622) (← links)
- (Q3050157) (← links)
- (Q3138745) (← links)
- Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities (Q3149887) (← links)
- (Q3350760) (← links)
- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction (Q3434697) (← links)
- Cyclic games and an algorithm to find minimax cycle means in directed graphs (Q3471889) (← links)
- (Q3486373) (← links)
- (Q3619946) (← links)
- On the exact solution of systems of linear inequalities and linear programming problems (Q3668311) (← links)
- (Q3696862) (← links)
- (Q3716822) (← links)
- (Q3780012) (← links)
- (Q3801352) (← links)
- (Q3812077) (← links)
