Obtaining online approximation algorithms for facility dispersion from offline algorithms.
- Published in:
- Networks, 2006, v. 47, n. 4, p. 206, doi. 10.1002/net.20109
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2006 AND VI 47 AND IP 4
Results: 6
1
2
Approximation algorithms for channel allocation problems in broadcast networks.
- Published in:
- Networks, 2006, v. 47, n. 4, p. 225, doi. 10.1002/net.20111
- By:
- Publication type:
- Article
3
A bidirected generalization of network matrices.
- Published in:
- Networks, 2006, v. 47, n. 4, p. 185, doi. 10.1002/net.20108
- By:
- Publication type:
- Article
4
Minimum multiple message broadcast graphs.
- Published in:
- Networks, 2006, v. 47, n. 4, p. 218, doi. 10.1002/net.20110
- By:
- Publication type:
- Article
5
Variations of the prize-collecting Steiner tree problem.
- Published in:
- Networks, 2006, v. 47, n. 4, p. 199, doi. 10.1002/net.20106
- By:
- Publication type:
- Article
6
The bi-criteria doubly weighted center-median path problem on a tree.
- Published in:
- Networks, 2006, v. 47, n. 4, p. 237, doi. 10.1002/net.20112
- By:
- Publication type:
- Article