Scientific contributions of Leo Khachiyan (a short overview)
type: Item
instance of: scholarly article
title: Scientific contributions of Leo Khachiyan (a short overview)
zbMATH Open document ID: 1144.01305
author: Endre Boros
author: Vladimir Gurvich
published in: Discrete Applied Mathematics
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 01A70
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5324133
MaRDI profile type: Publication
full work available at URL: j.dam.2008.04.023
OpenAlex ID: W1971647349
cites work: Convergence rate of the game processes for solving matrix games
cites work: Q3048622
cites work: Q4197641
cites work: Q3873927
cites work: Q3869076
cites work: Q3931026
cites work: Q3920993
cites work: Q3042881
cites work: Q3716822
cites work: Q3801352
cites work: A certain inequality for convex forms
cites work: Q4204004
cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs
cites work: The problem of calculating the volume of a polyhedron is enumerably hard
cites work: Q4283695
cites work: An inequality for the volume of inscribed ellipsoids
cites work: Q3486373
cites work: On the conductance of order Markov chains
cites work: Q4323609
cites work: Diagonal Matrix Scaling and Linear Programming
cites work: On the complexity of approximating the maximal inscribed ellipsoid for a polytope
cites work: Q3138745
cites work: On the rate of convergence of deterministic and randomized RAS matrix scaling algorithms
cites work: A greedy heuristic for a minimum-weight forest problem
cites work: Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
cites work: On the complexity of approximating extremal determinants in matrices
cites work: A sublinear-time randomized approximation algorithm for matrix games
cites work: An exponential‐function reduction method for block‐angular convex programs
cites work: On the complexity of nonnegative-matrix scaling
cites work: Diagonal matrix scaling is NP-hard
cites work: Coordination Complexity of Parallel Price-Directive Decomposition
cites work: Rounding of Polytopes in the Real Number Model of Computation
cites work: An Interior Point Method for Bordered Block-Diagonal Linear Programs
cites work: On the Complexity of Dualization of Monotone Disjunctive Normal Forms
cites work: Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
cites work: On the Complexity of Matrix Balancing
cites work: On the complexity of semidefinite programs
cites work: On the frequency of the most frequently occurring variable in dual monotone DNFs
cites work: Q4400635
cites work: Approximating fixed points of weakly contracting mappings
cites work: On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions
cites work: Integer optimization on convex semialgebraic sets
cites work: Q2754179
cites work: Dual-bounded generating problems: Weighted transversals of a hypergraph
cites work: Transversal hypergraphs and families of polyhedral cones
cites work: Q4535012
cites work: Approximate max-min resource sharing for structured concave optimization
cites work: Dual-bounded generating problems: Partial and multiple transversals of a hypergraph
cites work: Q4736834
cites work: Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
cites work: Q4708565
cites work: Generating dual-bounded hypergraphs
cites work: Q4449202
cites work: An inequality for polymatroid functions and its applications.
cites work: On maximal frequent and minimal infrequent sets in binary matrices
cites work: Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices
cites work: Algorithms - ESA 2003
cites work: Algorithms and Computation
cites work: LATIN 2004: Theoretical Informatics
cites work: Integer Programming and Combinatorial Optimization
cites work: Mathematical Foundations of Computer Science 2004
cites work: Computing and Combinatorics
cites work: Mathematical Foundations of Computer Science 2005
cites work: On the Complexity of Some Enumeration Problems for Matroids
cites work: Enumerating Spanning and Connected Subsets in Graphs and Matroids

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: Generating all vertices of a polyhedron is hard

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: Enumerating disjunctions and conjunctions of paths and cuts in reliability theory

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: Generating Minimal k-Vertex Connected Spanning Subgraphs

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: A global parallel algorithm for the hypergraph transversal problem

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: On enumerating minimal dicuts and strongly connected subgraphs

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: Generating all vertices of a polyhedron is hard

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: On short paths interdiction problems: Total and node-wise limited interdiction

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions

Scientific contributions of Leo Khachiyan (a short overview) (cites work)
cites work: Generating cut conjunctions in graphs and related problems

Scientific contributions of Leo Khachiyan (a short overview) (DOI)
DOI: 10.1016/J.DAM.2008.04.023