Multifacility Location Problems with Tree Structure and Finite Dominating Sets
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Kaiserslautern
- (wer)
-
Technische Universität Kaiserslautern, Fachbereich Mathematik
- (wann)
-
2018
- Urheber
-
Maier, Andrea
Ullmert, Thomas
Hamacher, Horst W.
- URN
-
urn:nbn:de:hbz:386-kluedo-51562
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:01 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Maier, Andrea
- Ullmert, Thomas
- Hamacher, Horst W.
- Technische Universität Kaiserslautern, Fachbereich Mathematik
Entstanden
- 2018
Ähnliche Objekte (12)
Solving nonconvex planar location problems by finite dominating sets
A Finite Dominating Set Algorithm for a Dynamic Location Problem in the Plane
Finite Dominating Sets for Rectilinear Center Problems with Polyhedral Barriers
Partitioning a graph into a dominating set, a total dominating set, and something else
In the complement of a dominating set
Disjoint Paired-Dominating sets in Cubic Graphs
Dominating
Random procedures for dominating sets in bipartite graphs
Reconfiguring dominating sets in minor-closed graph classes
Kernelization and Sparseness: the Case of Dominating Set
The Dominating Set Problem in Geometric Intersection Graphs
Reconfiguring Dominating Sets in Minor-Closed Graph Classes
Solving nonconvex planar location problems by finite dominating sets
A Finite Dominating Set Algorithm for a Dynamic Location Problem in the Plane
Finite Dominating Sets for Rectilinear Center Problems with Polyhedral Barriers
Partitioning a graph into a dominating set, a total dominating set, and something else
In the complement of a dominating set
Disjoint Paired-Dominating sets in Cubic Graphs
Dominating
Random procedures for dominating sets in bipartite graphs
Reconfiguring dominating sets in minor-closed graph classes
Kernelization and Sparseness: the Case of Dominating Set
The Dominating Set Problem in Geometric Intersection Graphs
Reconfiguring Dominating Sets in Minor-Closed Graph Classes
Solving nonconvex planar location problems by finite dominating sets
A Finite Dominating Set Algorithm for a Dynamic Location Problem in the Plane
Finite Dominating Sets for Rectilinear Center Problems with Polyhedral Barriers
Partitioning a graph into a dominating set, a total dominating set, and something else
In the complement of a dominating set
Disjoint Paired-Dominating sets in Cubic Graphs
Dominating
Random procedures for dominating sets in bipartite graphs
Reconfiguring dominating sets in minor-closed graph classes
Kernelization and Sparseness: the Case of Dominating Set
The Dominating Set Problem in Geometric Intersection Graphs