Detail publikace

Data Structures and Time Complexity of Algorithms

ŠEDA, M.

Anglický název

Data Structures and Time Complexity of Algorithms

Typ

Stať ve sborníku v databázi WoS či Scopus

Jazyk

en

Originální abstrakt

The focus of programming techniques for solving problems of operations research, graph theory, and many others areas is on how to design good algorithms and how to analyse their efficiency. Besides the fact that many problems can be solved more or less efficiently by various algorithms, their implementation efficiency can also be controlled by used data structures. In this paper, we present a simple algorithm for solving the minimum spanning tree problem and its more efficient implementation using a binary heap. This procedure is also used for an approximation algorithm of solving the network Steiner tree problem that belongs to the class of NP-hard problems.

Vydáno

2005-02-01

Nakladatel

Slovak University of Technology

Místo

Bratislava (Slovakia)

ISBN

80-969264-2-X

Kniha

Proceedings of the 4th International Conference Aplimat

Strany od–do

245–

Počet stran

6

BIBTEX


@inproceedings{BUT15919,
  author="Miloš {Šeda}",
  title="Data Structures and Time Complexity of Algorithms",
  booktitle="Proceedings of the 4th International Conference Aplimat",
  year="2005",
  pages="6",
  publisher="Slovak University of Technology",
  address="Bratislava (Slovakia)",
  isbn="80-969264-2-X"
}