#### Filter Results:

- Full text PDF available (24)

#### Publication Year

1973

2019

- This year (3)
- Last 5 years (11)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Alexander V. Karzanov
- Eur. J. Comb.
- 1998

LetH=(T,U) be a connected graph,V?Ta set, andca non-negative function on the unordered pairs of elements ofV. In theminimum0-extension problem(*), one is asked to minimize the inner productcmover all… (More)

Abstract An algorithm is described that finds optimal stationary strategies in dynamic two-person conflicts with perfect information, deterministic transitions, finite sets of positions, and… (More)

Let Q be a convex solid in ℝn, partitioned into two volumes u and v by an area s. We show that s>min(u,v)/diam Q, and use this inequality to obtain the lower bound n-5/2 on the conductance of order… (More)

In this paper, we give a complete characterization for the class of rational finite metrics μ with the property that the set Π(μ) of primitive extensions of μ is finite. Here, for a metric μ on a… (More)

Abstract Let G = ( VG , EG ) and H = ( VH , EH ) be two undirected graphs, and VH ⊆ VG . We associate with G and H the (unbounded) polyhedron P ( G , H ) in Q EG which consists of all nonegative… (More)

- Alexander V. Karzanov, S. Thomas McCormick
- SIAM J. Comput.
- 1997

We consider the problem of minimizing a separable convex objective function over the linear space given by a system Mx=0 with M a totally unimodular matrix. In particular, this generalizes the usual… (More)

- Alexander V. Karzanov
- Math. Program.
- 1994

LetN = (G, T, c, a) be a network, whereG is an undirected graph,T is a distinguished subset of its vertices (calledterminals), and each edgee ofG has nonnegative integer-valuedcapacity c(e) andcost… (More)