99
Voted
COCOON
15 years 2 months ago
2004 Springer 
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...
99
Voted
COCOON
15 years 18 days ago
2004 Springer 
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
COCOON
15 years 2 months ago
2004 Springer
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...
COCOON
15 years 2 months ago
2004 Springer
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
COCOON
15 years 2 months ago
2004 Springer
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...
|
Combinatorics