Amanote Research

Amanote Research

    RegisterSign In

2-Approximating Feedback Vertex Set in Tournaments

doi 10.1137/1.9781611975994.61
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2020

Authors
Daniel LokshtanovPranabendu MisraJoydeep MukherjeeFahad PanolanGeevarghese PhilipSaket Saurabh
Publisher

Society for Industrial and Applied Mathematics


Related search

Feedback Vertex Sets in Tournaments

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

A Cubic Kernel for Feedback Vertex Set

English

A Classification of Tournaments Having an Acyclic Tournament as a Minimum Feedback Arc Set

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2004English

The Minimal Covering Set in Large Tournaments

Social Choice and Welfare
EconomicsSocial SciencesEconometrics
2010English

Colour Transversal Vertex Covering Set

International Journal of Scientific and Innovative Mathematical Research
2016English

An Algorithm for the Feedback Vertex Set Problem on a Normal Helly Circular-Arc Graph

Journal of Computer and Communications
2016English

Interim Performance Feedback in Multistage Tournaments: The Optimality of Partial Disclosure

Journal of Labor Economics
Industrial RelationsEconomicsEconometrics
2011English

Analysis on Theoretical Bounds for Approximating Dominating Set Problems

Discrete Mathematics, Algorithms and Applications
CombinatoricsDiscrete Mathematics
2009English

New Mathematical Model for Finding Minimum Vertex Cut Set

2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy