Computer Algorithm Question
ymc_at_shgc.stanford.edu
Date: 02/11/05
- Next message: Paul Holbach: "Re: Existence of mathematical entities (Re: Successor Axiom: on what grounds TF?)"
- Previous message: examachine_at_gmail.com: "Re: Existence of mathematical entities (Re: Successor Axiom: on what grounds TF?)"
- Next in thread: el goog: "Re: Computer Algorithm Question"
- Reply: el goog: "Re: Computer Algorithm Question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 11 Feb 2005 11:45:48 -0800
There are finite points on a straight line. I need to cover all of them
by using a finite set of the segments of the straight line. Each
segment can only cover certain consecutive points. I need to find the
minimum set of segments to cover all the points.
What kind of computer algorithm can solve this problem?
Thanks!
- Next message: Paul Holbach: "Re: Existence of mathematical entities (Re: Successor Axiom: on what grounds TF?)"
- Previous message: examachine_at_gmail.com: "Re: Existence of mathematical entities (Re: Successor Axiom: on what grounds TF?)"
- Next in thread: el goog: "Re: Computer Algorithm Question"
- Reply: el goog: "Re: Computer Algorithm Question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|