Experiments on data reduction for optimal domination in networks
From MaRDI portal
(Redirected from Publication:863574)
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 2079336 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- A SIMPLE HEURISTIC FOR MINIMUM CONNECTED DOMINATING SET IN GRAPHS
- A refined search tree technique for dominating set on planar graphs
- A threshold of ln n for approximating set cover
- Bidimensionality: new connections between FPT algorithms and PTASs
- Domination in Graphs Applied to Electric Power Networks
- Experimental analysis of Heuristic algorithms for the dominating set problem
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
- Fundamentals of Computation Theory
- Polynomial-time data reduction for dominating set
- STACS 2005
Cited in
(27)- On approximating (connected) 2-edge dominating set by a tree
- Independent strong domination in complementary prisms
- On approximating (connected) 2-edge dominating set by a tree
- Fixed-parameter tractability results for full-degree spanning tree and its dual
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments
- Tree decompositions of graphs: saving memory in dynamic programming
- Dominating complex networks by identifying minimum skeletons
- scientific article; zbMATH DE number 708868 (Why is no real title available?)
- Kernelization: new upper and lower bound techniques
- Search-space reduction via essential vertices
- Linear-time computation of a linear problem kernel for dominating set on planar graphs
- A Retrospective on (Meta) Kernelization
- An experimental study on generating planar graphs
- Kernelization and complexity results for connectivity augmentation problems
- On approximate data reduction for the Rural Postman Problem: Theory and experiments
- Independent strong weak domination: A mathematical programming approach
- Computational study on planar dominating set problem
- Quadratic kernelization for convex recoloring of trees
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space
- SOFSEM 2006: Theory and Practice of Computer Science
- New analysis and computational study for the planar connected dominating set problem
- Reflections on kernelizing and computing unrooted agreement forests
- Upper bounds for \(\alpha \)-domination parameters
- Understanding the effectiveness of data reduction in public transportation networks
- Uncertain weighted dominating set: a prototype application on natural disaster relief management
- Data Reduction for Maximum Matching on Real-World Graphs
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability
This page was built for publication: Experiments on data reduction for optimal domination in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863574)
