Re: (tye)Re: converting complex netrange to cidr notation

Another interesting variant of this problem would be to find the minimal set of IP's + netmasks that cover a given range... hmm, I think a Golf outing is coming on :)

update: Actually, I think these are equivalent problems, so never mind, probably.

   MeowChow                                   
               s aamecha.s a..a\u$&owag.print

Comment on Re: (tye)Re: converting complex netrange to cidr notation

Replies are listed 'Best First'.
(tye)Re: converting complex netrange to cidr notation by tye (Sage) on May 12, 2001 at 09:30 UTC
For a single range, the above solution is the minimal one even if you allow arbitrary masks (though I haven't rigorously proved that -- just supporting your suspicion). If you allow multiple ranges, then the problem gets much harder and it becomes possible for arbitrary masks to provide smaller solutions. - tye (but my friends call me "Tye")	[reply]
Re: (tye)Re: converting complex netrange to cidr notation by dino (Sexton) on May 16, 2001 at 15:02 UTC
As a footnote I checked the above against http://www.csc.fi/english/funet/calc/laskin2.html The results agree ;-) tbfn Dino	[reply]


laziness, impatience, and hubris
	PerlMonks