Relevant bibliographies by topics / Weighted vertex cover

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Weighted vertex cover'

Author: Grafiati
Published: 3 June 2025
Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Weighted vertex cover.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Weighted vertex cover"

1

Hend Elmorsy. "Minimum Weighted Vertex Cover on Difference Graphs and It's Algorithm." Metallurgical and Materials Engineering 31, no. 4 (2025): 906–9. https://doi.org/10.63278/1532.

Full text
Abstract:
Let µ(G) and γ(G) be vertex covering number and independent number of G. In this paper compute minimum vertex cover on weighted vertex different graphs. An effective algorithm is illustrated to find minimum weighted vertex cover.
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Yong, and Hong Zhu. "Approximation algorithm for weighted weak vertex cover." Journal of Computer Science and Technology 19, no. 6 (2004): 782–86. http://dx.doi.org/10.1007/bf02973439.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Grandoni, Fabrizio, Jochen Könemann, and Alessandro Panconesi. "Distributed weighted vertex cover via maximal matchings." ACM Transactions on Algorithms 5, no. 1 (2008): 1–12. http://dx.doi.org/10.1145/1435375.1435381.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wei, Hao-Ting, Wing-Kai Hon, Paul Horn, Chung-Shou Liao, and Kunihiko Sadakane. "Approximating Dynamic Weighted Vertex Cover with Soft Capacities." Algorithmica 84, no. 1 (2021): 124–49. http://dx.doi.org/10.1007/s00453-021-00886-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Brešar, B., R. Krivoš-Belluš, G. Semanišin, and P. Šparl. "On the weighted k-path vertex cover problem." Discrete Applied Mathematics 177 (November 2014): 14–18. http://dx.doi.org/10.1016/j.dam.2014.05.042.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Pourhassan, Mojgan, Feng Shi, and Frank Neumann. "Parameterized Analysis of Multiobjective Evolutionary Algorithms and the Weighted Vertex Cover Problem." Evolutionary Computation 27, no. 4 (2019): 559–75. http://dx.doi.org/10.1162/evco_a_00255.

Full text
Abstract:
Evolutionary multiobjective optimization for the classical vertex cover problem has been analysed in Kratsch and Neumann ( 2013 ) in the context of parameterized complexity analysis. This article extends the analysis to the weighted vertex cover problem in which integer weights are assigned to the vertices and the goal is to find a vertex cover of minimum weight. Using an alternative mutation operator introduced in Kratsch and Neumann ( 2013 ), we provide a fixed parameter evolutionary algorithm with respect to [Formula: see text], the cost of an optimal solution for the problem. Moreover, we
APA, Harvard, Vancouver, ISO, and other styles
7

Niedermeier, Rolf, and Peter Rossmanith. "On efficient fixed-parameter algorithms for weighted vertex cover." Journal of Algorithms 47, no. 2 (2003): 63–77. http://dx.doi.org/10.1016/s0196-6774(03)00005-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Chlebík, Miroslav, and Janka Chlebíková. "Crown reductions for the Minimum Weighted Vertex Cover problem." Discrete Applied Mathematics 156, no. 3 (2008): 292–312. http://dx.doi.org/10.1016/j.dam.2007.03.026.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Yiu, Cheuk Hei Josh. "Research on Matching and Vertex Cover Problems in Bipartite Graphs using Simplex Method." Highlights in Science, Engineering and Technology 38 (March 16, 2023): 82–89. http://dx.doi.org/10.54097/hset.v38i.5737.

Full text
Abstract:
This paper considers a bipartite graph where a perfect matching does not necessarily exist. Linear programming is used in this paper as a special case of the linear program is the assignment problem, which is another name for the weighted maximum matching problem. The objective is to show that linear programming, in particular the simplex algorithm, can be used to calculate maximum weight matchings and minimum weighted vertex covers. This study also calculates and shows the equivalence of the maximum matching and minimum vertex cover cardinalities, and uses linear programming duality to presen
APA, Harvard, Vancouver, ISO, and other styles
10

Likas, Aristidis, and Andreas Stafylopatis. "A parallel algorithm for the minimum weighted vertex cover problem." Information Processing Letters 53, no. 4 (1995): 229–34. http://dx.doi.org/10.1016/0020-0190(94)00189-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Weighted vertex cover"

1

Ma, Zongjie. "Searching on Massive Graphs and Regularizing Deep Learning." Thesis, Griffith University, 2018. http://hdl.handle.net/10072/385875.

Full text
Abstract:
We have designed di erent heuristics for both searching on Massive graphs and regularizing Deep Neural Networks in this work. Both the problem of nding a minimum vertex cover (MinVC) and the maximum edge weight clique (MEWC) in a graph are prominent NP-hard problems of great importance in both theory and application. During recent decades, there has been much interest in nding optimal or near-optimal solutions to these two problems. Many existing heuristic algorithms for MinVC are based on local search strategies. An algorithm called FastVC takes a rst step towards solving the MinVC problem
APA, Harvard, Vancouver, ISO, and other styles
2

Chang, Ching-Chun, and 張景鈞. "On the Minimum Weighted Vertex Cover Problem." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/66ufkr.

Full text
Abstract:
碩士<br>元智大學<br>資訊工程學系<br>105<br>For each B∈{0,1}, a B-skip vertex cover of an undirected graph G=(V,E) refers to a set of vertices which are incident to at least |E|-B edges. We show that given G, B and a weight function w:V→Z^+, a minimum B-skip vertex cover of weight at most ⌈log_2⁡〖|V|〗 ⌉, if it exists, can be found in polynomial time. Our result and proof generalize those of Papadimitriou and Yannakakis.
APA, Harvard, Vancouver, ISO, and other styles
3

Liao, Guo-Jun, and 廖國鈞. "Weighted k-path Vertex Cover Problem in Cactus Graphs." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/74897149092914985575.

Full text
Abstract:
碩士<br>國立臺灣科技大學<br>資訊管理系<br>103<br>A subset S of vertices in graph G is a k-path vertex cover if every path of order k in G contains at least one vertex from S. The cardinality of a minimum k-path vertex cover is called the k-path vertex cover number of a graph G. In this thesis, we consider the weighted version of a k-path vertex cover problem, in which vertices are given weights, and propose an O(n3) algorithm for solving this problem in cactus graphs.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Weighted vertex cover"

1

Grandoni, Fabrizio, Jochen Könemann, and Alessandro Panconesi. "Distributed Weighted Vertex Cover via Maximal Matchings." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11533719_85.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mandal, Soumen, Pranabendu Misra, Ashutosh Rai, and Saket Saurabh. "Parameterized Approximation Algorithms for Weighted Vertex Cover." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-55601-2_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Niedermeier, Rolf, and Peter Rossmanith. "On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover." In Algorithms and Computation. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-40996-3_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xu, Hong, T. K. Satish Kumar, and Sven Koenig. "A New Solver for the Minimum Weighted Vertex Cover Problem." In Integration of AI and OR Techniques in Constraint Programming. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-33954-2_28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jovanovic, Raka, and Stefan Voß. "Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem." In Lecture Notes in Computer Science. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-34029-2_31.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Su, Gordon, Akshata Tiwari, Anand Narasimhamurthy, and T. K. Satish Kumar. "New Approaches for Winner Determination via Minimum Weighted Vertex Cover Computations." In Lecture Notes in Networks and Systems. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-1918-4_33.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhang, Yong, and Hong Zhu. "An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27798-9_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Yuanjie, Shaowei Cai, and Wenying Hou. "An Efficient Local Search Algorithm for Minimum Weighted Vertex Cover on Massive Graphs." In Lecture Notes in Computer Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-68759-9_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Pourhassan, Mojgan, Feng Shi, and Frank Neumann. "Parameterized Analysis of Multi-objective Evolutionary Algorithms and the Weighted Vertex Cover Problem." In Parallel Problem Solving from Nature – PPSN XIV. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45823-6_68.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ben-Basat, Ran, Guy Even, Ken-ichi Kawarabayashi, and Gregory Schwartzman. "A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in $$O(\log N\log \varDelta /\log ^2\log \varDelta )$$ Rounds." In Structural Information and Communication Complexity. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01325-7_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Weighted vertex cover"

1

Sun, Changhao, Xiangyin Zhang, Qingrui Zhou, and Huaxin Qiu. "Minimum Weighted Vertex Cover Approach to Task Allocation of Multiple Satellites." In 2024 43rd Chinese Control Conference (CCC). IEEE, 2024. http://dx.doi.org/10.23919/ccc63176.2024.10662544.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hao, Chenkai, and Enqiang Zhu. "CR-DIS: An Efficient Heuristic Algorithm for Minimum Weighted Vertex Cover Problem." In 2024 International Conference on New Trends in Computational Intelligence (NTCI). IEEE, 2024. https://doi.org/10.1109/ntci64025.2024.10776272.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kanj, Rouwaida. "Weighted Vertex Cover Using Disjoint Set Data Structures for the Memory Reconfiguration Problem." In 2025 26th International Symposium on Quality Electronic Design (ISQED). IEEE, 2025. https://doi.org/10.1109/isqed65160.2025.11014415.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Patwa, Madhvi, and Vishwajeet Goswami. "Evaluating an Optimum Weighted Connected Vertex Cover Using Hybrid Genetic Algorithm Over a Wireless Sensor Network." In 2024 First International Conference on Data, Computation and Communication (ICDCC). IEEE, 2024. https://doi.org/10.1109/icdcc62744.2024.10961051.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hu, Yuanyuan, Jie Chen, and Changbing Tang. "Prospect Theoretic Analysis on Weighted Vertex Cover of Networks." In 2021 40th Chinese Control Conference (CCC). IEEE, 2021. http://dx.doi.org/10.23919/ccc52363.2021.9549905.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sun, Changhao, Xiaochu Wang, Huaxin Qiu, and Qian Chen. "A Game Theoretic Solver for the Minimum Weighted Vertex Cover." In 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC). IEEE, 2019. http://dx.doi.org/10.1109/smc.2019.8914409.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cai, Shaowei, Wenying Hou, Jinkun Lin, and Yuanjie Li. "Improving Local Search for Minimum Weight Vertex Cover by Dynamic Strategies." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/196.

Full text
Abstract:
The minimum weight vertex cover (MWVC) problem is an important combinatorial optimization problem with various real-world applications. Due to its NP hardness, most works on solving MWVC focus on heuristic algorithms that can return a good quality solution in reasonable time. In this work, we propose two dynamic strategies that adjust the behavior of the algorithm during search, which are used to improve a state of the art local search for MWVC named FastWVC, resulting in two local search algorithms called DynWVC1 and DynWVC2. Previous MWVC algorithms are evaluated on graphs with random or han
APA, Harvard, Vancouver, ISO, and other styles
8

Sun, Changhao, Xiaochu Wang, Huaxin Qiu, Qian Chen, and Qingrui Zhou. "Distributed Optimization for Weighted Vertex Cover via Heuristic Game Theoretic Learning." In 2020 59th IEEE Conference on Decision and Control (CDC). IEEE, 2020. http://dx.doi.org/10.1109/cdc42340.2020.9304290.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Luo, Kaiyi. "An Asynchronous Game-based algorithm to the Weighted Vertex Cover of Networks." In 2020 International Conference on Computer Engineering and Intelligent Control (ICCEIC). IEEE, 2020. http://dx.doi.org/10.1109/icceic51584.2020.00036.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Koufogiannakis, Christos, and Neal E. Young. "Distributed and parallel algorithms for weighted vertex cover and other covering problems." In the 28th ACM symposium. ACM Press, 2009. http://dx.doi.org/10.1145/1582716.1582746.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Weighted vertex cover' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography