Dear Jorge:
Thank you for your kind reminder! And I mean it . Sorry for the ambiguity ,and I was just talked about the final result ,that is ,the fewest line map.
My question can be describer as this: the fewest line map 's generation take at least two stages, firstly, the subset elimination, note that now it's not a all-line-map;secondly ,then comes my concern ,the professor point out that this is a NP hard problem, and I want to understand this stage . Hope this time I make it clear. and looking forwad to your valuable replies.
Best,
Max
|