Algorithms for some center problems on networks

The present study deals with network location problems. We examine different center problems on networks and we present some theoretical results and efficient solution algorithms. The exploitation of the network structure effects improvements in algorithms. We present a new algorithm for the absolut...

Täydet tiedot

Bibliografiset tiedot
Päätekijä: Hämäläinen, Pentti
Aineistotyyppi: Väitöskirja
Kieli:eng
Julkaistu: 1984
Aiheet:
Linkit: https://jyx.jyu.fi/handle/123456789/103799
_version_ 1835762656745619456
author Hämäläinen, Pentti
author_facet Hämäläinen, Pentti Hämäläinen, Pentti
author_sort Hämäläinen, Pentti
datasource_str_mv jyx
description The present study deals with network location problems. We examine different center problems on networks and we present some theoretical results and efficient solution algorithms. The exploitation of the network structure effects improvements in algorithms. We present a new algorithm for the absolute p-center problem on tree networks. Linear time algorithms for the absolute p-center problem with p = 3 and 4 are given. For the absolute center problem we derive a new algorithm which does not need the shortest distance matrix of every pair of nodes. This makes it possible to solve absolute center problems on really large networks. Experimental results for this algorithm are also given. We also study the absolute center problem on some specific networks: networks with each edge having the same length, networks including separation nodes, and unicyclic networks. We have also generalized an absolute center definition for a subnetwork center. This new center problem is examined and solution methods are derived.
first_indexed 2025-06-19T20:01:29Z
format Väitöskirja
fullrecord [{"key": "dc.contributor.author", "value": "H\u00e4m\u00e4l\u00e4inen, Pentti", "language": null, "element": "contributor", "qualifier": "author", "schema": "dc"}, {"key": "dc.date.accessioned", "value": "2025-06-19T09:22:03Z", "language": null, "element": "date", "qualifier": "accessioned", "schema": "dc"}, {"key": "dc.date.available", "value": "2025-06-19T09:22:03Z", "language": null, "element": "date", "qualifier": "available", "schema": "dc"}, {"key": "dc.date.issued", "value": "1984", "language": null, "element": "date", "qualifier": "issued", "schema": "dc"}, {"key": "dc.identifier.isbn", "value": "978-952-86-0829-5", "language": null, "element": "identifier", "qualifier": "isbn", "schema": "dc"}, {"key": "dc.identifier.uri", "value": "https://jyx.jyu.fi/handle/123456789/103799", "language": null, "element": "identifier", "qualifier": "uri", "schema": "dc"}, {"key": "dc.description.abstract", "value": "The present study deals with network location problems. We examine different center problems on networks and we present some theoretical results and efficient solution algorithms. The exploitation of the network structure effects improvements in algorithms. We present a new algorithm for the absolute p-center problem on tree networks. Linear time algorithms for the absolute p-center problem with p = 3 and 4 are given. For the absolute center problem we derive a new algorithm which does not need the shortest distance matrix of every pair of nodes. This makes it possible to solve absolute center problems on really large networks. Experimental results for this algorithm are also given. We also study the absolute center problem on some specific networks: networks with each edge having the same length, networks including separation nodes, and unicyclic networks. We have also generalized an absolute center definition for a subnetwork center. This new center problem is examined and solution methods are derived.", "language": "en", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted by Harri Hirvi (hirvi@jyu.fi) on 2025-06-19T09:22:03Z\nNo. of bitstreams: 0", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Made available in DSpace on 2025-06-19T09:22:03Z (GMT). No. of bitstreams: 0\n Previous issue date: 1984", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.format.mimetype", "value": "application/pdf", "language": null, "element": "format", "qualifier": "mimetype", "schema": "dc"}, {"key": "dc.language.iso", "value": "eng", "language": null, "element": "language", "qualifier": "iso", "schema": "dc"}, {"key": "dc.relation.ispartofseries", "value": "Jyv\u00e4skyl\u00e4 studies in computer science, economics and statistics", "language": null, "element": "relation", "qualifier": "ispartofseries", "schema": "dc"}, {"key": "dc.rights", "value": "In Copyright", "language": null, "element": "rights", "qualifier": null, "schema": "dc"}, {"key": "dc.subject.other", "value": "algorithms", "language": null, "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "tietoverkot", "language": null, "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "ohjelmointi", "language": null, "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "algoritmit", "language": null, "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "verkkoteoria", "language": null, "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.title", "value": "Algorithms for some center problems on networks", "language": null, "element": "title", "qualifier": null, "schema": "dc"}, {"key": "dc.type", "value": "doctoral thesis", "language": null, "element": "type", "qualifier": null, "schema": "dc"}, {"key": "dc.identifier.urn", "value": "URN:ISBN:978-952-86-0829-5", "language": null, "element": "identifier", "qualifier": "urn", "schema": "dc"}, {"key": "dc.type.coar", "value": "http://purl.org/coar/resource_type/c_db06", "language": null, "element": "type", "qualifier": "coar", "schema": "dc"}, {"key": "dc.relation.numberinseries", "value": "6", "language": null, "element": "relation", "qualifier": "numberinseries", "schema": "dc"}, {"key": "dc.rights.copyright", "value": "\u00a9 The Author & University of Jyv\u00e4skyl\u00e4", "language": null, "element": "rights", "qualifier": "copyright", "schema": "dc"}, {"key": "dc.rights.accesslevel", "value": "restrictedAccess", "language": null, "element": "rights", "qualifier": "accesslevel", "schema": "dc"}, {"key": "dc.type.publication", "value": "doctoralThesis", "language": null, "element": "type", "qualifier": "publication", "schema": "dc"}, {"key": "dc.format.content", "value": "fulltext", "language": null, "element": "format", "qualifier": "content", "schema": "dc"}, {"key": "dc.rights.url", "value": "https://rightsstatements.org/page/InC/1.0/", "language": null, "element": "rights", "qualifier": "url", "schema": "dc"}, {"key": "dc.rights.accessrights", "value": "Aineistoon p\u00e4\u00e4sy\u00e4 on rajoitettu tekij\u00e4noikeussyist\u00e4. Aineisto on luettavissa Jyv\u00e4skyl\u00e4n yliopiston kirjaston <a href=\"https://www.jyu.fi/fi/osc/kirjasto/tyoskentelytilat/laitteet-ja-tilat#toc-jyx-ty-asema\">arkistoty\u00f6asemalta</a>.", "language": "fi", "element": "rights", "qualifier": "accessrights", "schema": "dc"}, {"key": "dc.rights.accessrights", "value": "<br><br>This material has a restricted access due to copyright reasons. It can be read at the <a href=\"https://www.jyu.fi/fi/osc/kirjasto/tyoskentelytilat/laitteet-ja-tilat#toc-jyx-ty-asema\">workstation</a> at Jyv\u00e4skyl\u00e4 University Library reserved for the use of archival materials.", "language": "en", "element": "rights", "qualifier": "accessrights", "schema": "dc"}, {"key": "dc.date.digitised", "value": "2025", "language": null, "element": "date", "qualifier": "digitised", "schema": "dc"}, {"key": "dc.type.okm", "value": "G4", "language": null, "element": "type", "qualifier": "okm", "schema": "dc"}]
id jyx.123456789_103799
language eng
last_indexed 2025-06-19T20:01:29Z
main_date 1984-01-01T00:00:00Z
main_date_str 1984
publishDate 1984
record_format qdc
source_str_mv jyx
spellingShingle Hämäläinen, Pentti Algorithms for some center problems on networks algorithms tietoverkot ohjelmointi algoritmit verkkoteoria
title Algorithms for some center problems on networks
title_full Algorithms for some center problems on networks
title_fullStr Algorithms for some center problems on networks Algorithms for some center problems on networks
title_full_unstemmed Algorithms for some center problems on networks Algorithms for some center problems on networks
title_short Algorithms for some center problems on networks
title_sort algorithms for some center problems on networks
title_txtP Algorithms for some center problems on networks
topic algorithms tietoverkot ohjelmointi algoritmit verkkoteoria
topic_facet algorithms algoritmit ohjelmointi tietoverkot verkkoteoria
url https://jyx.jyu.fi/handle/123456789/103799 http://www.urn.fi/URN:ISBN:978-952-86-0829-5
work_keys_str_mv AT hämäläinenpentti algorithmsforsomecenterproblemsonnetworks