Optimal online ring routing.
- Published in:
- Networks, 2011, v. 57, n. 2, p. 187, doi. 10.1002/net.20400
- By:
- Publication type:
- Article
Works matching IS 00283045 AND DT 2011 AND VI 57 AND IP 2
Results: 10
1
2
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two.
- Published in:
- Networks, 2011, v. 57, n. 2, p. 115, doi. 10.1002/net.20390
- By:
- Publication type:
- Article
3
Earliest arrival flows on series-parallel graphs.
- Published in:
- Networks, 2011, v. 57, n. 2, p. 169, doi. 10.1002/net.20398
- By:
- Publication type:
- Article
4
Single-vehicle scheduling problems with release and service times on a line.
- Published in:
- Networks, 2011, v. 57, n. 2, p. 128, doi. 10.1002/net.20393
- By:
- Publication type:
- Article
5
Constructions of small regular bipartite graphs of girth 6.
- Published in:
- Networks, 2011, v. 57, n. 2, p. 121, doi. 10.1002/net.20392
- By:
- Publication type:
- Article
6
A minimum cost flow formulation for approximated MLC segmentation.
- Published in:
- Networks, 2011, v. 57, n. 2, p. 135, doi. 10.1002/net.20394
- By:
- Publication type:
- Article
7
Nonadaptive broadcasting in trees.
- Published in:
- Networks, 2011, v. 57, n. 2, p. 157, doi. 10.1002/net.20396
- By:
- Publication type:
- Article
8
On cut-based inequalities for capacitated network design polyhedra.
- Published in:
- Networks, 2011, v. 57, n. 2, p. 141, doi. 10.1002/net.20395
- By:
- Publication type:
- Article
9
Stackelberg network pricing is hard to approximate.
- Published in:
- Networks, 2011, v. 57, n. 2, p. 117, doi. 10.1002/net.20391
- By:
- Publication type:
- Article
10
On terminal delta-wye reducibility of planar graphs.
- Published in:
- Networks, 2011, v. 57, n. 2, p. 174, doi. 10.1002/net.20399
- By:
- Publication type:
- Article