Sciweavers

COCOON
2004
Springer
13 years 11 months ago
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
Yong Zhang, Hong Zhu
COCOON
2004
Springer
13 years 11 months ago
Algorithms for the On-Line Quota Traveling Salesman Problem
Giorgio Ausiello, Marc Demange, Luigi Laura, Vange...
COCOON
2004
Springer
13 years 11 months ago
Transshipment Through Crossdocks with Inventory and Time Windows
Abstract. The supply chain between manufacturers and retailers always includes transshipments through a network of locations. A major challenge in making demand meet supply has bee...
Andrew Lim, Zhaowei Miao, Brian Rodrigues, Zhou Xu
COCOON
2004
Springer
13 years 9 months ago
Regular Expressions for Languages over Infinite Alphabets
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if ...
Michael Kaminski, Tony Tan
COCOON
2004
Springer
13 years 11 months ago
Coloring Octrees
An octree is a recursive partition of the unit cube, such that in each step a cube is subdivided into eight smaller cubes. Those cubes that are not further subdivided are the leave...
Udo Adamy, Michael Hoffmann, József Solymos...
Combinatorics
Top of PageReset Settings