Detail publikace

Data Structures and Time Complexity of Algorithms

ŠEDA, M.

Originální název

Data Structures and Time Complexity of Algorithms

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

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.

Klíčová slova v angličtině

priority queue, binary heap, spanning tree, Steiner tree

Autoři

ŠEDA, M.

Rok RIV

2005

Vydáno

1. 2. 2005

Nakladatel

Slovak University of Technology

Místo

Bratislava (Slovakia)

ISBN

80-969264-2-X

Kniha

Proceedings of the 4th International Conference Aplimat

Strany od

245

Strany do

250

Strany počet

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"
}