74 search results - page 2 / 15 » A note on the size of minimal covers |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
WIA
1998
Springer
15 years 1 months ago
1998
Springer
A cover-automaton A of a finite language L is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic co...
129
click to vote
Lecture Notes
These lecture notes cover several topics such as Optimization, Technology and profit maximization, Profit maximization and cost minimization, The cost function & duality, Consu...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
ABSTRACT. This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associat...
DM
2007
14 years 9 months ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...