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

DOI10.1016/0020-0255(93)90127-8MaRDI QIDQ1310947zbMATH OpenOpenAlexFDO

Authors 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

heuristicNP-hardoptimization problembroadcast network\(\Sigma\) graphslocally distributed processing systemsresource migration

Mathematics Subject Classification ID

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

Recommendations

• Algorithms - ESA 2003
• The minimum generalized vertex cover problem
• scientific article; zbMATH DE number 2119748
• Capacitated vertex covering
• A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Optimizing joins in fragmented database systems on a broadcast local network

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310947)