Amanote Research
Register
Sign In
The Minimum K-Cover Problem
Applied Mathematical Sciences
doi 10.12988/ams.2013.13211
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2013
Authors
Anna Gorbenko
Vladimir Popov
Publisher
Hikari, Ltd.
Related search
An Optimal Algorithm for the Minimum Disc Cover Problem
Algorithmica
Applied Mathematics
Computer Science Applications
Computer Science
Crown Reductions for the Minimum Weighted Vertex Cover Problem
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
A Heuristic Approach for Minimum Set Cover Problem
International Journal of Advanced Research in Artificial Intelligence
A Modified Hopfield Neural Network for the Minimum Vertex Cover Problem
IEEJ Transactions on Electronics, Information and Systems
Electronic Engineering
Electrical
Efficient Determination of the K Most Vital Edges for the Minimum Spanning Tree Problem
Computers and Operations Research
Management Science
Simulation
Computer Science
Operations Research
Modeling
On the Minimum Dummy-Arc Problem
RAIRO - Operations Research
Management Science
Computer Science Applications
Operations Research
Theoretical Computer Science
The Minimum Rank Problem Over Finite Fields
Electronic Journal of Linear Algebra
Number Theory
Algebra
A Branch & Price Algorithm for the Minimum Cost Clique Cover Problem in Max-Point Tolerance Graphs
4OR
Mathematics
Management Science
Management Information Systems
Computational Theory
Operations Research
Theoretical Computer Science
Two Variations of the Minimum Steiner Problem
Journal of Combinatorial Optimization
Control
Optimization
Combinatorics
Applied Mathematics
Discrete Mathematics
Computer Science Applications
Mathematics
Computational Theory