We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a r...
Jill R. Hardin, George L. Nemhauser, Martin W. P. ...
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight n...