Corpus ID: 7428984

Multicriteria Steiner Tree Problem for Communication Network

@article{Levin2011MulticriteriaST,
  title={Multicriteria Steiner Tree Problem for Communication Network},
  author={Mark Sh. Levin and Rustem I. Nuriakhmetov},
  journal={ArXiv},
  year={2011},
  volume={abs/1102.2524}
}
  • Mark Sh. Levin, Rustem I. Nuriakhmetov
  • Published 2011
  • Mathematics, Computer Science
  • ArXiv
  • This paper addresses combinatorial optimization scheme for solving the multicriteria Steiner tree problem for communication network topology design (e.g., wireless mesh network). The solving scheme is based on several models: multicriteria ranking, clustering, minimum spanning tree, and minimum Steiner tree problem. An illustrative numerical example corresponds to designing a covering long-distance Wi-Fi network (static Ad-Hoc network). The set of criteria (i.e., objective functions) involves… CONTINUE READING
    9 Citations

    References

    SHOWING 1-10 OF 28 REFERENCES
    Minimum cost multicast trees in ad hoc networks
    • A. Penttinen
    • Computer Science
    • 2006 IEEE International Conference on Communications
    • 2006
    • 22
    • PDF
    Steiner Tree Problems in Telecommunications
    • S. Voß
    • Computer Science
    • Handbook of Optimization in Telecommunications
    • 2006
    • 39
    Optimum Communication Spanning Trees in Series-Parallel Networks
    • 9
    Cost-optimal topology planning of hierarchical access networks
    • 28
    Steiner's Problem in Graphs: Heuristic Methods
    • S. Voß
    • Mathematics, Computer Science
    • Discret. Appl. Math.
    • 1992
    • 141
    • PDF