Factor 4/3 approximations for minimum 2-connected subgraphsVEMPALA, S; VETTA, A.Lecture notes in computer science. 2000, pp 262-273, issn 0302-9743, isbn 3-540-67996-0Conference Paper

Random sampling of Euler toursTETALI, P; VEMPALA, S.Algorithmica. 2001, Vol 30, Num 3, pp 376-385, issn 0178-4617Article

Random sampling of Euler toursTETALI, P; VEMPALA, S.Lecture notes in computer science. 1997, pp 57-66, issn 0302-9743, isbn 3-540-63248-4Conference Paper

Approximating multicast congestionVEMPALA, S; VÖCKING, B.Lecture notes in computer science. 1999, pp 367-372, issn 0302-9743, isbn 3-540-66916-7Conference Paper

Semi-definite relaxations for minimum bandwidth and other vertex-ordering problemsBLUM, A; KONJEVOD, G; RAVI, R et al.Theoretical computer science. 2000, Vol 235, Num 1, pp 25-42, issn 0304-3975Article

New approximation guarantees for minimum-weight k-trees and prize-collecting salesmenAWERBUCH, B; AZAR, Y; BLUM, A et al.SIAM journal on computing (Print). 1999, Vol 28, Num 1, pp 254-262, issn 0097-5397Article