Graph covering using bounded size subgraphs
From MaRDI portal
Publication:6132557
DOI10.1007/978-3-031-25211-2_32OpenAlexW4318022970MaRDI QIDQ6132557FDOQ6132557
Authors: Barun Gorain, Shaswati Patra, Rishi Ranjan Singh 
Publication date: 17 August 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-25211-2_32
Cites Work
- Improved approximations for tour and tree covers
- Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs
- How to trim a MST, a 2-approximation algorithm for minimum cost-tree cover
- Min-max tree covers of graphs.
- Ramsey numbers and an approximation algorithm for the vertex cover problem
- Title not available (Why is that?)
- Tree exploration with little memory
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Algorithms – ESA 2005
- A 2-approximation algorithm for the minimum weight edge dominating set problem
- On approximability of the independent/connected edge dominating set problems
- The importance of being biased
- Title not available (Why is that?)
- Approximating the tree and tour covers of a graph
- Automata, Languages and Programming
- Generalized bounded tree cover of a graph
- Exploring Unknown Undirected Graphs
- Optimal constrained graph exploration
- Deterministic graph exploration with advice
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating the Minimum Tour Cover with a Compact Linear Program
- Edge exploration of a graph by mobile agent
- Edge exploration of anonymous graph by mobile agent with external help
This page was built for publication: Graph covering using bounded size subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132557)
