We give a 2-approximation algorithm for the version with a bounded number of bins.
Specifically, the simulation results show that it is most useful on a bounded number of processors.
With resource sharing, for large conferences with a bounded number of concurrent speakers, resource requirements do not increase with the number of potential speakers.
For every target time T⩾0, our algorithm meshes the spacetime volume M×[0,T] with a bounded number of non-degenerate tetrahedra.
Our result holds for a general definition of survivability and for any norm whose ball is specified by a piecewise algebraic curve of bounded degree and with a bounded number of pieces.
In dimension n=2, S̆veràk proved that there exists an optimal domain in the class of all open subsets of a given bounded open set, whose complements have a uniformly bounded number of connected components.
In this paper we present a simple scheduling algorithm based on list-scheduling and task-duplication on a bounded number of heterogeneous machines, called Heterogeneous Critical Parents with Fast Duplicator HCPFDD).
Due to the importance of communication networks, a topology control algorithm should guarantee certain required consistency properties (e.g., connectivity of the topology), while achieving desired optimization properties (e.g., a bounded number of neighbors).
Thus, these duplication heuristics inevitably induce redundant duplications, which lead to the superfluous consumption of resources and generally deteriorate the scheduling result in the case of a bounded number of processors.
Motivated by a problem in the design of optical networks, we ask when a graph has a spanning spider (subdivision of a star), or, more generally, a spanning tree with a bounded number of branch vertices.
A polynomially bounded number of operations is allowed, including encryption (but not decryption), over PK and the ciphertexts.
