AAAAAA

   
Results: 1-10 |
Results: 10
PRIMAL-DUAL RNC APPROXIMATION ALGORITHMS FOR SET COVER AND COVERING INTEGER PROGRAMS
Authors: RAJAGOPALAN S VAZIRANI VV
Citation: S. Rajagopalan et Vv. Vazirani, PRIMAL-DUAL RNC APPROXIMATION ALGORITHMS FOR SET COVER AND COVERING INTEGER PROGRAMS, SIAM journal on computing (Print), 28(2), 1999, pp. 526-541
THE ART OF TRELLIS DECODING IS COMPUTATIONALLY HARD - FOR LARGE FIELDS
Authors: JAIN K MANDOIU I VAZIRANI VV
Citation: K. Jain et al., THE ART OF TRELLIS DECODING IS COMPUTATIONALLY HARD - FOR LARGE FIELDS, IEEE transactions on information theory, 44(3), 1998, pp. 1211-1214
PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR INTEGRAL FLOW AND MULTICUT IN TREES
Authors: GARG N VAZIRANI VV YANNAKAKIS M
Citation: N. Garg et al., PRIMAL-DUAL APPROXIMATION ALGORITHMS FOR INTEGRAL FLOW AND MULTICUT IN TREES, Algorithmica, 18(1), 1997, pp. 3-20
APPROXIMATE MAX-FLOW MIN-(MULTI)CUT THEOREMS AND THEIR APPLICATIONS
Authors: GARG N VAZIRANI VV YANNAKAKIS M
Citation: N. Garg et al., APPROXIMATE MAX-FLOW MIN-(MULTI)CUT THEOREMS AND THEIR APPLICATIONS, SIAM journal on computing, 25(2), 1996, pp. 235-251
AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL TRELLISES FOR CODES OVER FINITE ABELIAN-GROUPS
Authors: VAZIRANI VV SARAN H RAJAN BS
Citation: Vv. Vazirani et al., AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL TRELLISES FOR CODES OVER FINITE ABELIAN-GROUPS, IEEE transactions on information theory, 42(6), 1996, pp. 1839-1854
FINDING K-CUTS WITHIN TWICE THE OPTIMAL
Authors: SARAN H VAZIRANI VV
Citation: H. Saran et Vv. Vazirani, FINDING K-CUTS WITHIN TWICE THE OPTIMAL, SIAM journal on computing, 24(1), 1995, pp. 101-108
A POLYHEDRON WITH ALL S-T CUTS AS VERTICES, AND ADJACENCY OF CUTS
Authors: GARG N VAZIRANI VV
Citation: N. Garg et Vv. Vazirani, A POLYHEDRON WITH ALL S-T CUTS AS VERTICES, AND ADJACENCY OF CUTS, Mathematical programming, 70(1), 1995, pp. 17-25
ONLINE ALGORITHMS FOR WEIGHTED BIPARTITE MATCHING AND STABLE MARRIAGES
Authors: KHULLER S MITCHELL SG VAZIRANI VV
Citation: S. Khuller et al., ONLINE ALGORITHMS FOR WEIGHTED BIPARTITE MATCHING AND STABLE MARRIAGES, Theoretical computer science, 127(2), 1994, pp. 255-267
RANDOMIZED PARALLEL ALGORITHMS FOR MATROID UNION AND INTERSECTION, WITH APPLICATIONS TO ARBORESENCES AND EDGE-DISJOINT SPANNING-TREES
Authors: NARAYANAN H SARAN H VAZIRANI VV
Citation: H. Narayanan et al., RANDOMIZED PARALLEL ALGORITHMS FOR MATROID UNION AND INTERSECTION, WITH APPLICATIONS TO ARBORESENCES AND EDGE-DISJOINT SPANNING-TREES, SIAM journal on computing, 23(2), 1994, pp. 387-397
IMPROVED BOUNDS FOR THE MAX-FLOW MIN-MULTICUT RATIO FOR PLANAR AND K(R,R)-FREE GRAPHS
Authors: TARDOS E VAZIRANI VV
Citation: E. Tardos et Vv. Vazirani, IMPROVED BOUNDS FOR THE MAX-FLOW MIN-MULTICUT RATIO FOR PLANAR AND K(R,R)-FREE GRAPHS, Information processing letters, 47(2), 1993, pp. 77-80
Risultati: 1-10 |