Found: 6
Select item for more details and to access through your institution.
Solving the Minimum Independent Domination Set Problem in Graphs by Exact Algorithm and Greedy Heuristic.
- Published in:
- RAIRO -- Operations Research, 2013, v. 47, n. 3, p. 199, doi. 10.1051/ro/2013034
- By:
- Publication type:
- Article
Hardness Results and Heuristic for Multi-groups Interconnection.
- Published in:
- Computer Journal, 2010, v. 53, n. 9, p. 1497, doi. 10.1093/comjnl/bxp072
- By:
- Publication type:
- Article
Bicriteria scheduling for contiguous and non contiguous parallel tasks.
- Published in:
- Annals of Operations Research, 2008, v. 159, n. 1, p. 97, doi. 10.1007/s10479-007-0282-1
- By:
- Publication type:
- Article
AN OPTIMAL REBUILDING STRATEGY FOR AN INCREMENTAL TREE PROBLEM.
- Published in:
- Journal of Interconnection Networks, 2007, v. 8, n. 1, p. 75, doi. 10.1142/S0219265907001916
- By:
- Publication type:
- Article
A NOTE ON BICRITERIA SCHEDULES WITH OPTIMAL APPROXIMATIONS RATIOS.
- Published in:
- Parallel Processing Letters, 2004, v. 14, n. 2, p. 315, doi. 10.1142/S0129626404001891
- By:
- Publication type:
- Article
Minimum gossip bus networks.
- Published in:
- Networks, 1996, v. 27, n. 3, p. 239, doi. 10.1002/(SICI)1097-0037(199605)27:3<239::AID-NET8>3.0.CO;2-J
- By:
- Publication type:
- Article