Geometric TSP can be approximated
in [Theory]
|
Prev: PSPACE completeness and Public-key cryptography
Next: Informatics 2010: 1st call extension - 30 April 2010
From: Link on 8 Apr 2010 08:50 Theorem: Geometric TSP can be approximated in polynomial time within (1+e)*OPT for any e>0.
From: Inverse JSH Musatov 19 on 8 Apr 2010 10:22
Attempt to blow yourself, and sever your spinal cord. Die of neglect, alone, and hated by all. "Link" <marty.musatov(a)gmail.com> wrote in message news:f1b9c74f-dd6b-497d-b8f2-3d854024b2d7(a)b23g2000yqn.googlegroups.com... > > Theorem: Geometric TSP can be approximated in my rectum. > |