Exact algorithms and applications for tree-like Weighted Set Cover
From MaRDI portal
Recommendations
- On efficient fixed-parameter algorithms for weighted vertex cover
- A multivariate approach for weighted FPT algorithms
- Two fixed-parameter algorithms for vertex covering by paths on trees
- Kernelization and parameterized algorithms for covering a tree by a set of stars or paths
- Approximating the minmax rooted-tree cover in a tree
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 1559541 (Why is no real title available?)
- scientific article; zbMATH DE number 1361465 (Why is no real title available?)
- scientific article; zbMATH DE number 1834638 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A partial k-arboretum of graphs with bounded treewidth
- A threshold of ln n for approximating set cover
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Algorithms and Data Structures
- Algorithms – ESA 2004
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- An Almost Linear-Time Algorithm for Graph Realization
- Approximating \(k\)-set cover and complementary graph coloring
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Fixed-parameter tractability and data reduction for multicut in trees
- Graph minors. II. Algorithmic aspects of tree-width
- Graph-Theoretic Concepts in Computer Science
- Mathematical Foundations of Computer Science 2004
- Optimal Capacity Scheduling—I
- Optimization, approximation, and complexity classes
- Practical algorithms on partial k-trees with an application to domination-like problems
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Refined memorization for vertex cover
- Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
- Treewidth. Computations and approximations
Cited in
(21)- The complexity of weighted counting for acyclic conjunctive queries
- scientific article; zbMATH DE number 6815827 (Why is no real title available?)
- On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT
- Parameterized algorithms for weighted matching and packing problems
- On structural parameterizations of \textsc{Hitting Set}: hitting paths in graphs using 2-SAT
- Tree decompositions of graphs: saving memory in dynamic programming
- A multivariate approach for weighted FPT algorithms
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- scientific article; zbMATH DE number 4160470 (Why is no real title available?)
- Weighted target set selection on trees and cycles
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- Efficient computation of tolerances in the weighted independent set problem for trees
- Computing cooperative solution concepts in coalitional skill games
- A dynamic programming algorithm for tree-like weighted set packing problem
- Parameterized complexity of weighted multicut in trees
- Static and dynamic source locations in undirected networks
- Parameterized complexity of multicut in weighted trees
- An approximation algorithm for the \(B\)-prize-collecting multicut problem in trees
- Set cover, set packing and hitting set for tree convex and tree-like set systems
- Preferences single-peaked on a tree: multiwinner elections and structural results
- Hardness and algorithms for electoral manipulation under media influence
This page was built for publication: Exact algorithms and applications for tree-like Weighted Set Cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866547)
