Approximation of Partial Capacitated Vertex Cover

SIAM Journal on Discrete Mathematics - United States
doi 10.1137/080728044
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Improved Upper Bounds for Partial Vertex Cover

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

An Exact Algorithm for the Capacitated Vertex -Center Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2006English

Approximation Schemes for Capacitated Clustering in Doubling Metrics

2020English

Approximation and Kernelization for Chordal Vertex Deletion

2017English

Properties of Vertex Cover Obstructions

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2007English

Revisiting the Vertex Cover of Graphs

Applied Mathematical Sciences
2015English

Dynamical Vertex Approximation for the Two-Dimensional Hubbard Model

Journal of Magnetism and Magnetic Materials
OpticalElectronicCondensed Matter PhysicsMagnetic Materials
2016English

On Cutwidth Parameterized by Vertex Cover

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2012English

Parameterized Complexity of Generalized Vertex Cover Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy