Approximation algorithm for the minimum partial connected Roman dominating set problem
Zhang, Yaoyao ; Zhang, Zhao ; Du, Ding-Zhu
- Link zu diesem Datensatz
- https://d-nb.info/1337142042
- Titel
- Approximation algorithm for the minimum partial connected Roman dominating set problem
- Art des Inhalts
- Teil eines Werks
- Verfassangaben
- by Yaoyao Zhang, Zhao Zhang, Ding-Zhu Du
- Autor(en)
-
- Zhang, Yaoyao
- Zhang, Zhao
- Du, Ding-Zhu
- Organisation(en)
-
- SpringerLink (Online service)
- Zeitliche Einordnung
- Erscheinungsdatum: 2024
- Umfang/Format
- 1 Online-Ressource.
- DOI
- 10.1007/s10878-024-01124-y
- Online
- https://doi.org/10.1007/s10878-024-01124-y
- Sprache
- eng
- Schlagwörter
-
- (lcsh)Discrete mathematics.
- (lcsh)Convex geometry .
- (lcsh)Discrete geometry.
- (lcsh)Mathematical models.
- (lcsh)Computer science.
- (lcsh)Mathematical optimization.
- (lcsh)Operations research.
- Discrete Mathematics.
- Convex and Discrete Geometry.
- Mathematical Modeling and Industrial Mathematics.
- Theory of Computation.
- Optimization.
- Operations Research and Decision Theory.
- Frühere/spätere Titel
-
- Enthalten in: Journal of combinatorial optimization
- Enthalten in: Journal of combinatorial optimization
- Enthalten in: Journal of combinatorial optimization
- Stand
- 30.07.2024 07:15
- Im Katalog seit
- 07.03.2026