Name
Title | ||
|---|---|---|
Improved Approximating Algorithms for Computing Energy Constrained Minimum Cost Steiner Trees. |
Abstract | ||
|---|---|---|
Nowadays, two issues in data transmission for networks are attracting considerable interest in the research community: energy efficiency and cost minimization, i.e., to minimize the energy consumed and resource occupied. This paper considers approximation algorithms for the energy constrained minimum cost Steiner tree (ECMST) problem which have applications in energy-efficient minimum cost multicast. |
Year | Venue | Field |
|---|---|---|
2015 | ICA3PP | Approximation algorithm,Mathematical optimization,Data transmission,Efficient energy use,Steiner tree problem,Computer science,Parallel computing,Theoretical computer science,Minification,Multicast,Lagrangian relaxation |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nianchen Zou | 1 | 0 | 0.34 |
| Longkun Guo | 2 | 6 | 5.49 |