Increasing Internet Capacity Using Local Search
By Bernard Fortz, Mikkel Thorup. Computational optimization and applications, 2004
307 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/05f1475c2e9d86020965b9a75d614979677a3b90
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Maurício Resende
- P. Pardalos
- M. Ericsson
- Mikkel Thorup
- Bernard Fortz
- Jennifer Rexford
- Peter Sanders
- Dominik Schultes
In Computer Networks and Communications
- Mikkel Thorup
- Bernard Fortz
- Jennifer Rexford
- Maurício Resende
- P. Pardalos
- M. Ericsson
- Zong Woo Geem
- Danda B. Rawat
Citations in the corpus
- Optimizing OSPF/IS-IS weights in a changing world (2002, methodology): “As in [19] and [20], we limit the number of weight changes considered by applying random sampling to the neighborhood structure, as exploring the full neighborhood is too time consuming.”
- A Genetic Algorithm for the Weight Setting Problem in OSPF Routing (2002, methodology): “Fortz and Thorup [12] prove that it is NP-hard to find not only the optimal setting of OSPF weights for the OSPFWS problem, but even finding an approximate solution is NP-hard.”
- Traffic engineering with traditional IP routing protocols (2002, background): “Readers interested in the results of experiments on a wide variety of real and synthetic topologies can refer to [20].”