Pregled bibliografske jedinice broj: 1014180
Independent sets and vertex covers considered within the context of robust optimization
Independent sets and vertex covers considered within the context of robust optimization // Mathematical communications, 25 (2020), 67-86 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1014180 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Independent sets and vertex covers considered within the context of robust optimization
Autori
Klobučar, Ana ; Manger, Robert
Izvornik
Mathematical communications (1331-0623) 25
(2020);
67-86
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
weighted graph ; independent set ; vertex cover ; robust optimization
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.
Izvorni jezik
Engleski
Znanstvena područja
Matematika, Računarstvo
POVEZANOST RADA
Projekti:
HRZZ-IP-2018-01-5591 - Efikasni algoritmi za robusnu diskretnu optimizaciju (RoDiOpt) (Manger, Robert, HRZZ ) ( CroRIS)
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb,
Prirodoslovno-matematički fakultet, Zagreb,
Fakultet strojarstva i brodogradnje, Zagreb
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
