Re: Proof of an integer programming problem

From: Michael Mendelsohn (keine.Werbung.1300_at_msgid.michael.mendelsohn.de)
Date: 04/08/04

  • Next message: Michael Mendelsohn: "Re: all paths between 2 nodes"
    Date: Thu, 08 Apr 2004 08:42:58 +0200
    
    

    Gang Lu schrieb:
    > I am trying to prove whether a problem is NP. Can someone give me some
    > hints?

    Have you thought about the K=1 case?

    Michael

    -- 
    Feel the stare of my burning hamster and stop smoking!
    

  • Next message: Michael Mendelsohn: "Re: all paths between 2 nodes"

    Relevant Pages


    Loading