Parameterized Complexity and Approximability of Directed Odd Cycle Transversal

doi 10.1137/1.9781611975994.134
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Minimum-Weight Cycle Covers and Their Approximability

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Correction To: Weighted Upper Edge Cover: Complexity and Approximability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Approximation and Parameterized Complexity of Minimax Approval Voting

Journal of Artificial Intelligence Research
Artificial Intelligence
2018English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Parameterized Complexity of Cardinality Constrained Optimization Problems

Computer Journal
Computer Science
2007English

The Quadratic Shortest Path Problem: Complexity, Approximability, and Solution Methods

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2018English

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