Minimum-weight vertex cover problem for two-class resource connection graphs

DOI10.1016/0020-0255(93)90127-8zbMath0783.68090OpenAlexW2027091728MaRDI QIDQ1310947

Jason S. J. Chen, Victor O. K. Li

Publication date: 20 March 1994

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(93)90127-8

zbMATH Keywords

NP-hardheuristicoptimization problembroadcast network\(\Sigma\) graphslocally distributed processing systemsresource migration

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Optimizing joins in fragmented database systems on a broadcast local network
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum-weight vertex cover problem for two-class resource connection graphs