http://www.bigredbits.com/archives/249 Theory, Distributed Systems, and Other Random Bits Sat, 23 Apr 2011 06:32:20 +0000 hourly 1 http://wordpress.org/?v=3.3.1 http://www.bigredbits.com/archives/249/comment-page-1#comment-179 Ashwin Wed, 18 Nov 2009 05:38:19 +0000 http://www.bigredbits.com/?p=249#comment-179 I was thinking about minimizing the number of violated degree constraints(with the restriction that we have that each degree bound is violated by atmost one). It looks to me that any bound of o(n) will imply a \omega(log(n)) approximation algorithm for the longest path problem when the graph has hamiltonian path. Any thoughts about this? I was thinking about minimizing the number of violated degree constraints(with the restriction that we have that each degree bound is violated by atmost one). It looks to me that any bound of o(n) will imply a \omega(log(n)) approximation algorithm for the longest path problem when the graph has hamiltonian path. Any thoughts about this?

]]>