Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
Michael R. Fellows, Christian Knauer, Naomi Nishim...
The Distributed Object Group Framework(DOGF) we constructed supports the grouping of distributed objects that are required for distributed application. From the DOGF, we manage dis...
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
Topological representations are being used to define geometric models suitable for grid generation and grid generation tools are being developed that work directly on topological ...
In [17], an abstract framework for automatically generating loop invariants of imperative programs was proposed. This framework was then instantiated for the language of conjuncti...