hrcak mascot   Srce   HID

Izvorni znanstveni članak

Independent sets and vertex covers considered within the context of robust optimization

Ana Klobučar ; University of Zagreb, Faculty of Mechanical Engineering and Naval Architecture, Zagreb, Croatia
Robert Manger ; University of Zagreb, Faculty of Science, Department of Mathematics, Zagreb, Croatia

Puni tekst: engleski, pdf (246 KB) str. 67-86 preuzimanja: 127* citiraj
APA 6th Edition
Klobučar, A. i Manger, R. (2020). Independent sets and vertex covers considered within the context of robust optimization. Mathematical Communications, 25 (1), 67-86. Preuzeto s https://hrcak.srce.hr/235541
MLA 8th Edition
Klobučar, Ana i Robert Manger. "Independent sets and vertex covers considered within the context of robust optimization." Mathematical Communications, vol. 25, br. 1, 2020, str. 67-86. https://hrcak.srce.hr/235541. Citirano 02.12.2021.
Chicago 17th Edition
Klobučar, Ana i Robert Manger. "Independent sets and vertex covers considered within the context of robust optimization." Mathematical Communications 25, br. 1 (2020): 67-86. https://hrcak.srce.hr/235541
Harvard
Klobučar, A., i Manger, R. (2020). 'Independent sets and vertex covers considered within the context of robust optimization', Mathematical Communications, 25(1), str. 67-86. Preuzeto s: https://hrcak.srce.hr/235541 (Datum pristupa: 02.12.2021.)
Vancouver
Klobučar A, Manger R. Independent sets and vertex covers considered within the context of robust optimization. Mathematical Communications [Internet]. 2020 [pristupljeno 02.12.2021.];25(1):67-86. Dostupno na: https://hrcak.srce.hr/235541
IEEE
A. Klobučar i R. Manger, "Independent sets and vertex covers considered within the context of robust optimization", Mathematical Communications, vol.25, br. 1, str. 67-86, 2020. [Online]. Dostupno na: https://hrcak.srce.hr/235541. [Citirano: 02.12.2021.]

Sažetak
This paper studies robust variants of the maximum weighted independent set problem and the minimum weighted vertex cover problem, respectively. Both problems are posed in a vertex-weighted graph. The paper explores whether the complement of a robustly optimal independent set must be a robustly optimal vertex cover, and vice-versa.

Ključne riječi
weighted graph; independent set; vertex cover; robust optimization

Hrčak ID: 235541

URI
https://hrcak.srce.hr/235541

Posjeta: 269 *