Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

DOI10.1007/B11961MaRDI QIDQ5900919zbMATH OpenOpenAlexFDO

Authors Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha

Publication date 26 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11961

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• On covering vertices of a graph by trees
• scientific article; zbMATH DE number 1878047
• scientific article; zbMATH DE number 5126095
• scientific article; zbMATH DE number 1837688
• scientific article; zbMATH DE number 975337
• Covering a graph by forests and a matching
• scientific article; zbMATH DE number 1454641
• scientific article; zbMATH DE number 99003
• Kernelization and parameterized algorithms for covering a tree by a set of stars or paths
• On star-cover and path-cover of a tree

Cited in

(18)

• Covering the edges of a graph by a prescribed tree with minimum overlap
• Min-max cover of a graph with a small number of parts
• Extremal problems on k-ary trees with respect to the cover cost and reverse cover cost
• Approximation algorithms for generalized bounded tree cover
• Generalized bounded tree cover of a graph
• Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
• scientific article; zbMATH DE number 5126095 (Why is no real title available?)
• Covering a tree by a forest
• scientific article; zbMATH DE number 1556750 (Why is no real title available?)
• scientific article; zbMATH DE number 949664 (Why is no real title available?)
• scientific article; zbMATH DE number 1837688 (Why is no real title available?)
• scientific article; zbMATH DE number 1878047 (Why is no real title available?)
• An algorithm for minimum weight star covers of graphs
• Approximation to the Minimum Rooted Star Cover Problem
• The two-squirrel problem and its relatives
• FPT approximation for fair minimum-load clustering
• Approximation algorithm for the min-max partial tree cover problem
• On covering vertices of a graph by trees

This page was built for publication: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900919)