Result 1 to 20 of 221 total
Heuristic algorithms for solving survivability problem in the design of last mile communication networks. (English)
Pan, Jeng-Shyang (ed.) et al., Intelligent information and database systems. 4th Asian conference, ACIIDS 2012, Kaohsiung, Taiwan, March 19‒21, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-28489-2/pbk). Lecture Notes in Computer Science 7197. Lecture Notes in Artificial Intelligence, 519-528 (2012).
1
The relation of connected set cover and group Steiner tree. (English)
Theor. Comput. Sci. 438, 96-101 (2012).
2
New approximation algorithm for minimum Steiner tree problem. (English)
Int. Math. Forum 6, No. 53-56, 2625-2636 (2011).
3
An improved approximation algorithm for the terminal Steiner tree problem. (English)
Murgante, Beniamino (ed.) et al., Computational science and its applications ‒ ICCSA 2011. International conference, Santander, Spain, June 20‒23, 2011. Proceedings, Part III. Berlin: Springer (ISBN 978-3-642-21930-6/pbk). Lecture Notes in Computer Science 6784, 141-151 (2011).
4
ESC: estimation of selecting core for reducing multicast delay variation under delay constraints. (English)
Int. J. Commun. Syst. 24, No. 1, 40-52 (2011).
5
An exact algorithm for the Steiner tree problem with delays. (English)
Haouari, M. (ed.) et al., ISCO 2010. International symposium on combinatorial optimization. Papers based on the presentations at the symposium, Hammamet, Tunesia, March 24‒26, 2010. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 36, 223-230 (2010).
6
The regenerator location problem. (English)
Networks 55, No. 3, 205-220 (2010).
7
The word and geodesic problems in free solvable groups. (English)
Trans. Am. Math. Soc. 362, No. 9, 4655-4682 (2010).
8
An efficient algorithm for the Steiner tree problem with revenue, bottleneck and hop objective functions. (English)
Eur. J. Oper. Res. 207, No. 1, 45-49 (2010).
9
A viral system massive infection algorithm to solve the Steiner tree problem in graphs with medium terminal density. (English)
Int. J. Bio-Inspired Comput. 2, No. 2, 71-77 (2010).
10
Discrete particle swarm optimization for the minimum labelling Steiner tree problem. (English)
Nat. Comput. 9, No. 1, 29-46 (2010).
11
Inverse bottleneck Steiner tree problem under norm. (Chinese)
J. Shenyang Norm. Univ., Nat. Sci. 27, No. 1, 13-15 (2009).
12
Stabilization of locally minimal trees. (English)
Math. Notes 86, No. 4, 483-492 (2009); translation from Mat. Zametki 86, No. 4, 512-524 (2009).
13
Discrete particle swarm optimization for multiple destination routing problems. (English)
Giacobini, M. (ed.) et al., Applications of evolutionary computing. EvoWorkshops 2009: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG, Tübingen, Germany, April 15‒17, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-01128-3/pbk). Lecture Notes in Computer Science 5484, 117-122 (2009).
14
Approximation schemes for node-weighted geometric Steiner tree problems. (English)
Algorithmica 55, No. 1, 240-267 (2009).
15
Steiner trees for fixed orientation metrics. (English)
J. Glob. Optim. 43, No. 1, 141-169 (2009).
16
Inapproximability of survivable networks. (English)
Theor. Comput. Sci. 410, No. 21-23, 2122-2125 (2009).
17
Elementary approximation algorithms for prize collecting Steiner tree problems. (English)
Inf. Process. Lett. 107, No. 1, 39-44 (2008).
18
A hybrid transgenetic algorithm for the prize collecting Steiner tree problem. (English)
J. UCS 14, No. 15, 2491-2511, electronic only (2008).
19
Elementary approximation algorithms for prize collecting Steiner tree problems. (English)
Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21‒24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 246-254 (2008).
20
Result 1 to 20 of 221 total
Start
Contact
Print
General Help
