WorldCat Identities

Karzanov, Aleksandr V.

Overview
Works: 37 works in 57 publications in 2 languages and 135 library holdings
Roles: Author, Other
Publication Timeline
.
Most widely held works by Aleksandr V Karzanov
Polynomial uncrossing processes by A. V Karzanov( Book )

5 editions published in 1990 in English and German and held by 12 WorldCat member libraries worldwide

A characterization of minimizable metrics in the multifacility location problem by Hans-Jürgen Bandelt( Book )

2 editions published in 1999 in English and held by 11 WorldCat member libraries worldwide

Path problems in skew-symmetric graphs by Andrew V Goldberg( Book )

4 editions published between 1993 and 1996 in English and held by 11 WorldCat member libraries worldwide

Abstract: "We study path problems in skew-symmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skew-symmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive with the fastest algorithms for the standard problems."
Maximum skew symmetric flows and their applications to B-matchings by Andrew V Goldberg( Book )

1 edition published in 1999 in English and held by 11 WorldCat member libraries worldwide

Metrics with finite sets of primitive extensions by Aleksandr V Karzanov( Book )

1 edition published in 1997 in English and held by 8 WorldCat member libraries worldwide

On weighted multicommodity flows in directed networks by Maxim Babenko( Book )

1 edition published in 2012 in English and held by 7 WorldCat member libraries worldwide

Multiflows and disjoint paths of minimum total cost by Alexander V Karzanov( Book )

4 editions published between 1995 and 1997 in English and held by 7 WorldCat member libraries worldwide

On the structure of regular chrystals of types A, B, C by V. I Danilov( Book )

1 edition published in 2012 in English and held by 7 WorldCat member libraries worldwide

Maximization over the intersection of two compatible greedy-polyhedra by A. V Karzanov( Book )

3 editions published in 1991 in English and German and held by 6 WorldCat member libraries worldwide

A combinatorial algorithm for the minimum (2, [gamma])-metric problem and some generalizations by Alexander V Karzanov( Book )

1 edition published in 1998 in English and held by 5 WorldCat member libraries worldwide

On the conductance of order Markov chains by Alexander V Karzanov( Book )

2 editions published in 1990 in English and held by 5 WorldCat member libraries worldwide

Abstract: "Let Q be a convex solid in R[superscript n], partitioned into two volumes u and v by an area s. We show that s [greater than or equal to] min(u, v)/diam Q, and use this inequality to obtain the lower bound [formula] on the conductance of order Markov chains, which describe nearly uniform generators of linear extensions for posets of size n. We also discuss an application of the above results to the problem of sorting of posets."
A combinatorial algorithm for the minimum (2,r)-metric problem and some generalizations by Aleksandr V Karzanov( Book )

1 edition published in 1998 in English and held by 5 WorldCat member libraries worldwide

Minimum distance mappings of graphs by Alexander V Karzanov( Book )

2 editions published in 1995 in English and held by 4 WorldCat member libraries worldwide

How to tidy up a symmetric set-system by A. V Karzanov( Book )

2 editions published in 1995 in English and held by 4 WorldCat member libraries worldwide

Minimum (2,r)-metrics, graph partitions and multiflows by Alexander V Karzanov( Book )

2 editions published in 1995 in English and held by 4 WorldCat member libraries worldwide

Abstract: "We deal with a graph G=(V,E), a subset T [subset of] V, a function c : E -> Z[subscript +] and a symmetric function [mu] : T x T -> Z[subscript +]. Suppose that we wish to find a partition II of V into [absolute value of T] sets X[subscript t], t [element of] T, such that each X[subscript t] contains t and the sum of numbers [mu](st)c(e) among the edges e of G connecting sets X[subscript s] and X[subscript t] in II is as small as possible. When [mu] is all-unit, this is a version of the minimum graph partition problem (referred also as the minimum multi-cut problem) and it is known to be strongly NP-hard. On the other hand, it has been shown that the problem is polynomially solvable if [mu] is the distance function of the complete bipartite graph with parts of 2 and r=[absolute value of T]-2 nodes. This is just the minimum (2,r)-metric problem considered in the present paper. We prove that the multicommodity flow problem which is dual of the minimum (2,r)-metric problem has an integer optimal solution whenever c is inner Eulerian, i.e., each cut in G not separating T has an even capacity with respect to c. Moreover, such a solution can be found in strongly polynomial time. Also we consider structural and polyhedral aspects concerning the general case of the metric minimization problem and give some results on metrics [mu] for which the minimum value of the objective in this problem is the same as in its fractional relaxation."
On one maximum multiflow problem and related metrics by Alexander V Karzanov( Book )

1 edition published in 1996 in English and held by 2 WorldCat member libraries worldwide

Cyclical games with prohibitions by A. V Karzanov( Book )

2 editions published in 1990 in English and held by 2 WorldCat member libraries worldwide

Polynomial methods for separable convex optimization in unimodular linear spaces with applications to circulations and co-circulations in networks by A. V Karzanov( Book )

2 editions published in 1994 in English and held by 2 WorldCat member libraries worldwide

Planar flows and quadratic relations over semirings by V. I Danilov( )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

Tropical Plücker functions and Kashiwara crystals of types A, B, C by V. I Danilov( )

1 edition published in 2013 in English and held by 2 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.90 (from 0.72 for Planar flo ... to 0.97 for Planar flo ...)

Alternative Names
Karzanov, A. V.

Karzanov, Alexander V.

Karzanov, Alexandr Viktorovič

Languages
English (36)

German (3)