h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

k-Slow Burning: Complexity and Upper Bounds

; ;

In
Graphs and combinatorial optimization: from theory to applications : CTW 2023, Garmisch-Partenkirchen, Germany, June 20–22 / Andreas Brieden, Stefan Pickl, Markus Siegle editors, Seiten/Artikel-Nr: 67-79

Konferenz/Event:19. Cologne-Twente Workshop on Graphs and Combinatorial Optimization , Garmisch-Partenkirchen , Germany , CTW 2023 , 2023-06-20 - 2023-06-22

ImpressumCham, Switzerland : Springer

Umfang67-79

ISBN978-3-031-46825-4, 978-3-031-46826-1, 978-3-031-46827-8, 978-3-031-46828-5

ReiheAIRO Springer series ; 13

Online
DOI: 10.1007/978-3-031-46826-1_6


Einrichtungen

  1. Lehr- und Forschungsgebiet Diskrete Optimierung (113320)
  2. Fachgruppe Mathematik (110000)
  3. Lehrstuhl für Management Science (815110)



Dokumenttyp
Contribution to a book/Contribution to a conference proceedings

Format
online, print

Sprache
English

Anmerkung
No peer reviewed article

Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-85186416892
WOS Core Collection: WOS:001260368800006

Interne Identnummern
RWTH-2024-07930
Datensatz-ID: 991844

Beteiligte Länder
Germany

 GO

QR Code for this record

The record appears in these collections:
Document types > Events > Contributions to a conference proceedings
Document types > Books > Contributions to a book
Faculty of Mathematics and Natural Sciences (Fac.1) > Department of Mathematics
School of Business and Economics (Fac.8)
Public records
Publications database
815110
110000
113320
 Record created 2024-08-26, last modified 2025-10-06
Similar records



Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)