87 search results - page 5 / 18 » Solving large Steiner Triple Covering Problems |
124
Voted
HEURISTICS
2010
14 years 10 months ago
2010
The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This pro...
121
Voted
MOBIHOC
2006
ACM
16 years 3 months ago
2006
ACM
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
130
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...
138
Voted
INFOCOM
1995
IEEE
15 years 7 months ago
1995
IEEE
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
150
Voted
DBVIS
1995
15 years 7 months ago
1995
More and more of our customers have to deal with very large datasets like elevation data and digital roadmaps covering Europe or even the entire world, very large images e.g. from...