Linda S. Moonen

Learn More
The topology of the Internet has initially been modelled as an undirected graph, where vertices correspond to so-called Autonomous Systems (ASs), and edges correspond to physical links between pairs of ASs. However, in order to capture the impact of routing policies, it has recently become apparent that one needs to classify the edges according to the(More)
In this note we study the complexity of the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We show that the resulting tooling problem is strongly NP-complete, even in case of unit loading and unloading costs. However, we show that if the capacity of the(More)
Classical measures of network connectivity are the number of disjoint paths between a pair of nodes, and the size of a minimum cut. For standard graphs, these measures can be computed efficiently using network flow techniques. However, in the Internet on the level of Autonomous Systems (ASs), referred to as AS-level Inter-net, routing policies impose(More)
  • 1