Geometric TSP can be approximated
in [Math]
|
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. >
From: marty.musatov on 8 Apr 2010 06:40 > Attempt to blow yourself, and sever your spinal > cord. Die of neglect, > alone, and hated by all. No. > > "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. > > > >
From: Inverse JSH Musatov 19 on 8 Apr 2010 10:54 "marty.musatov(a)gmail.com" <meami(a)vzw.blackberry.net> wrote in message news:1409501331.523600.1270737664995.JavaMail.root(a)gallium.mathforum.org... >> Attempt to blow yourself, and sever your spinal >> cord. Die of neglect, >> alone, and hated by all. With rats gnawing at your sightless eyeballs, your mouth and nose overflowing with a writhing mass of maggots.
|
Pages: 1 Prev: Theorem: The maximum cut problem Next: Acceptable Cache Configuration with Multiple Outs |