Nalazite se na CroRIS probnoj okolini. Ovdje evidentirani podaci neće biti pohranjeni u Informacijskom sustavu znanosti RH. Ako je ovo greška, CroRIS produkcijskoj okolini moguće je pristupi putem poveznice www.croris.hr
izvor podataka: crosbi

Independent sets and vertex covers considered within the context of robust optimization (CROSBI ID 267820)

Prilog u časopisu | izvorni znanstveni rad | međunarodna recenzija

Klobučar, Ana ; Manger, Robert Independent sets and vertex covers considered within the context of robust optimization // Mathematical communications, 25 (2020), 67-86

Podaci o odgovornosti

Klobučar, Ana ; Manger, Robert

engleski

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

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.

weighted graph ; independent set ; vertex cover ; robust optimization

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

nije evidentirano

Podaci o izdanju

25

2020.

67-86

objavljeno

1331-0623

1848-8013

Povezanost rada

Matematika, Računarstvo

Indeksiranost