A 2 + approximation algorithm for the k-MST problem

Math. Program., Ser. A 107, 491–504 (2006) Digital Object Identifier (DOI) 10.1007/s10107-005-0693-1 Sanjeev Arora  · ...
Author:  Arora S. |  Karakostas G.

12 downloads 478 Views 177KB Size Report

This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!

Report copyright / DMCA form

Recommend Documents

Math. Program., Ser. A 90: 101–111 (2001) Digital Object Identifier (DOI) 10.1007/s101070100213 Yinyu Ye A .699-approx...

Computational Optimization and Applications, 32, 215–230, 2005 2005 Springer Science + Business Media, Inc. Manufactured...

Computational Optimization and Applications, 21, 277–300, 2002 c 2002 Kluwer Academic Publishers. Manufactured in The Ne...

J Comb Optim (2007) 13:217–221 DOI 10.1007/s10878-006-9024-6 A 2-approximation for the preceding-and-crossing structure...

Math. Program., Ser. B 104, 583–608 (2005) Digital Object Identifier (DOI) 10.1007/s10107-005-0630-3 Robert Mifflin · C...

Comput Visual Sci 7: 153–157 (2004) Digital Object Identifier (DOI) 10.1007/s00791-004-0134-3 Computing and Visualizati...

Comput Optim Appl (2007) 38: 249–259 DOI 10.1007/s10589-007-9043-y A bilinear algorithm for sparse representations Pand...

Journal of Mathematical Sciences, Vol. 126, No. 3, 2005 A 2|E|/4-TIME ALGORITHM FOR MAX-CUT A. S. Kulikov and S. S. Fed...

A Problem for Defeasibility Theories Deborah Scaduto-Horn The Journal of Philosophy, Vol. 79, No. 1. (Jan., 1982), pp. 4...