A unified approach to approximating resource allocation and scheduling
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A unified approach to approximating resource allocation and scheduling
Journal of the ACM (JACM)
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Throughput maximization of real-time scheduling with batching
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
New bounds on the size of the minimum feedback vertex set in meshes and butterflies
Information Processing Letters
Routing and Admission Control in Networks with Advance Reservations
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Decycling numbers of random regular graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Minimum feedback vertex sets in shuffle-based interconnection networks
Information Processing Letters
Feedback vertex sets in star graphs
Information Processing Letters
New upper bounds on feedback vertex numbers in butterflies
Information Processing Letters
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Bidimensionality: new connections between FPT algorithms and PTASs
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Exact computation of minimum feedback vertex sets with relational algebra
Fundamenta Informaticae
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences
An efficient approximation for the generalized assignment problem
Information Processing Letters
Admission control with advance reservations in simple networks
Journal of Discrete Algorithms
Resource allocation in bounded degree trees
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Efficient approximation of convex recolorings
Journal of Computer and System Sciences
A fixed-parameter algorithm for the directed feedback vertex set problem
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Feedback vertex set on AT-free graphs
Discrete Applied Mathematics
A fixed-parameter algorithm for the directed feedback vertex set problem
Journal of the ACM (JACM)
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences
Throughput maximization of real-time scheduling with batching
ACM Transactions on Algorithms (TALG)
Towards a theory for securing time synchronization in wireless sensor networks
Proceedings of the second ACM conference on Wireless network security
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks
Minimum cycle bases: Faster and simpler
ACM Transactions on Algorithms (TALG)
Feedback numbers of de Bruijn digraphs
Computers & Mathematics with Applications
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
A cubic kernel for feedback vertex set
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Exact algorithms for maximum acyclic subgraph on a superclass of cubic graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
A linear kernel for planar feedback vertex set
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A quartic kernel for pathwidth-one vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Approximation algorithms for minimum chain vertex deletion
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
A factor 2 approximation algorithm for the vertex cover P3 problem
Information Processing Letters
Tradeoffs in process strategy games with application in the WDM reconfiguration problem
Theoretical Computer Science
Approximation algorithms for orienting mixed graphs
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Feedback vertex set in mixed graphs
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Hitting and harvesting pumpkins
ESA'11 Proceedings of the 19th European conference on Algorithms
A Tabu search heuristic based on k-diamonds for the weighted feedback vertex set problem
INOC'11 Proceedings of the 5th international conference on Network optimization
A primal-dual approximation algorithm for the vertex cover P3 problem
Theoretical Computer Science
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Using fractional primal-dual to schedule split intervals with demands
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Improved approximation algorithm for convex recoloring of trees
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Optimal wavelength converter placement with guaranteed wavelength usage
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Efficient approximation of convex recolorings
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Improved fixed-parameter algorithms for two feedback set problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
EDGE DOMINATING SET: efficient enumeration-based exact algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
The undirected feedback vertex set problem has a poly(k) kernel
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Theoretical Computer Science
Hitting diamonds and growing cacti
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Safe approximation and its relation to kernelization
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem
Journal of Combinatorial Theory Series B
Survey: Cycle bases in graphs characterization, algorithms, complexity, and applications
Computer Science Review
Using fractional primal-dual to schedule split intervals with demands
Discrete Optimization
Directed subset feedback vertex set is fixed-parameter tractable
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Exact Computation of Minimum Feedback Vertex Sets with Relational Algebra
Fundamenta Informaticae
Combination of parallel machine scheduling and vertex cover
Theoretical Computer Science
Improved algorithms for the feedback vertex set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Feedback vertex set on graphs of low clique-width
European Journal of Combinatorics
Approximation algorithms for orienting mixed graphs
Theoretical Computer Science
The vertex cover P3 problem in cubic graphs
Information Processing Letters
| Hi-index | 0.01 |
A feedback vertex set of a graph is a subset of vertices that contains at least one vertex from every cycle in the graph. The problem considered is that of finding a minimum feedback vertex set given a weighted and undirected graph. We present a simple and efficient approximation algorithm with performance ratio of at most 2, improving previous best bounds for either weighted or unweighted cases of the problem. Any further improvement on this bound, matching the best constant factor known for the vertex cover problem, is deemed challenging.The approximation principle, underlying the algorithm, is based on a generalized form of the classical local ratio theorem, originally developed for approximation of the vertex cover problem, and a more flexible style of its application.