Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

57

Voted

IPL
2007

favoriteEmaildiscussreport

51views more IPL 2007»

A note on the size of minimal covers

15 years 10 days ago

A note on the size of minimal covers

Download www-di.inf.puc-rio.br

Vaston G. Costa, Edward Hermann Haeusler, Eduardo

Real-time Traffic

IPL 2007 |

claim paper

Related Content

» Multiple Kronecker covering graphs

» On the sum minimization version of the online bin covering problem

» Improved approximation algorithms for minimum ANDcircuits problem via kset cover

» A note on the perimeter of fat objects

» Admission control to minimize rejections and online set cover with repetitions

» Minimal CoverAutomata for Finite Languages

» Advanced Microeconomics

» Bounds on the coefficients of the characteristic and minimal polynomials

» Properties of vertex cover obstructions

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	IPL
Authors	Vaston G. Costa, Edward Hermann Haeusler, Eduardo Sany Laber, Loana Tito Nogueira

Comments (0)