Items where Author is "Hougardy, S"

Journal article

HOUGARDY, S. and VINKEMEIER, D.E., 2006. Approximating weighted matchings in parallel. Information Processing Letters, 99 (3), pp. 119-123. ISSN 0020-0190

VINKEMEIER, D.E.D. and HOUGARDY, S., 2005. A linear-time approximation algorithm for weighted matchings in graphs. ACM Transactions on Algorithms, 1 (1), pp. 107-122. ISSN 1549-6325

DRAKE, D.E. and HOUGARDY, S., 2004. On approximation algorithms for the terminal Steiner tree problem. Information Processing Letters, 89 (1), pp. 15-18. ISSN 0020-0190

DRAKE, D.E. and HOUGARDY, S., 2003. A simple approximation algorithm for the weighted matching problem. Information Processing Letters, 85 (4), pp. 211-213. ISSN 0020-0190

Chapter in book

DRAKE, D.E. and HOUGARDY, S., 2003. Linear time local improvements for weighted matchings in graphs. In: K. JANSEN, M. MARGRAF, M. MASTROLILLI and J.D.P. ROLIM, eds., Experimental and efficient algorithms: Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings. Lecture Notes in Computer Science (2647). Berlin: Springer, pp. 107-119. ISBN 9783540402053

DRAKE, D.E. and HOUGARDY, S., 2003. Improved linear time approximation algorithms for weighted matchings. In: S. ARORA, K. JANSEN, J.D.P. ROLIM and A. SAHAI, eds., Approximation, randomization, and combinatorial optimization. Algorithms and techniques: 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approx. Lecture Notes in Computer Science . Berlin: Springer, pp. 14-23. ISBN 9783540407706; 9783540451983