Crown Reductions for the Minimum Weighted Vertex Cover Problem

Discrete Applied Mathematics - Netherlands
doi 10.1016/j.dam.2007.03.026
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Modified Hopfield Neural Network for the Minimum Vertex Cover Problem

IEEJ Transactions on Electronics, Information and Systems
Electronic EngineeringElectrical
2004English

The Minimum K-Cover Problem

Applied Mathematical Sciences
2013English

Extension and Its Price for the Connected Vertex Cover Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Simulated Annealing Algorithm for the Minimum Weighted Perfect Euclidean Matching Problem

RAIRO - Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchTheoretical Computer Science
1986English

An Optimal Algorithm for the Minimum Disc Cover Problem

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2007English

A Heuristic Approach for Minimum Set Cover Problem

International Journal of Advanced Research in Artificial Intelligence
2015English

Local Search With Edge Weighting and Configuration Checking Heuristics for Minimum Vertex Cover

Artificial Intelligence
LinguisticsLanguageArtificial Intelligence
2011English

Vertex Degree Weighted Path Indices

Acta Chimica Slovenica
Chemistry
2016English

New Mathematical Model for Finding Minimum Vertex Cut Set

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy