×

zbMATH — the first resource for mathematics

Efficient distributed algorithms for topology control problem with shortest path constraints. (English) Zbl 1184.68364

MSC:
68R10 Graph theory (including graph drawing) in computer science
41A99 Approximations and expansions
05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] DOI: 10.1109/JCN.2002.6596929 · doi:10.1109/JCN.2002.6596929
[2] DOI: 10.1002/net.10097 · Zbl 1031.05092 · doi:10.1002/net.10097
[3] DOI: 10.1016/0012-365X(90)90358-O · Zbl 0739.05079 · doi:10.1016/0012-365X(90)90358-O
[4] Garey M. R., Computer and Intractablity: A Guide to the Theory of NP-Completeness (1978)
[5] DOI: 10.1006/jagm.1997.0903 · Zbl 0894.68105 · doi:10.1006/jagm.1997.0903
[6] Kim D. Y., IEEE Transactions on Mobile Computing (IEEE TMC)
[7] DOI: 10.1007/s11276-005-1769-9 · Zbl 02225402 · doi:10.1007/s11276-005-1769-9
[8] DOI: 10.1016/S0020-0190(99)00064-2 · Zbl 1002.68202 · doi:10.1016/S0020-0190(99)00064-2
[9] DOI: 10.1002/wcm.356 · Zbl 05460960 · doi:10.1002/wcm.356
[10] DOI: 10.1137/0211025 · Zbl 0478.68043 · doi:10.1137/0211025
[11] DOI: 10.1145/185675.306789 · Zbl 0814.68064 · doi:10.1145/185675.306789
[12] DOI: 10.1002/net.3230250205 · Zbl 0821.90128 · doi:10.1002/net.3230250205
[13] DOI: 10.1007/s10898-005-8466-1 · Zbl 1103.90097 · doi:10.1007/s10898-005-8466-1
[14] DOI: 10.1109/LCOMM.2006.1603363 · doi:10.1109/LCOMM.2006.1603363
[15] DOI: 10.1109/TMC.2007.1034 · Zbl 05340556 · doi:10.1109/TMC.2007.1034
[16] DOI: 10.1007/s11036-006-4469-5 · Zbl 05025393 · doi:10.1007/s11036-006-4469-5
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.