Abstract
Let ℋ be a family of graphs. An ℋ-packing of a graph G is a set {G1, G2,…,Gk} of disjoint subgraphs of G such that each Gj is isomorphic to some element of ℋ. An ℋ-packing of a graph G that covers the maximum number of vertices of G is called a maximum ℋ-packing of G. The ℋ-packing problem seeks to find a maximum ℋ-packing of a graph. Let i be a positive integer. An i-star is a complete bipartite graph K1,i. This paper investigates the ℋ-packing problem with H being a family of stars. For an arbitrary family 𝒮 of stars, we design a linear-time algorithm for the 𝒮-packing problem in trees. Let t be a positive integer. An ℋ-packing is called a t+-star packing if ℋ consists of i-stars with i ≥ t. We show that the t+-star packing problem for t ≥ 2 is NP-hard in bipartite graphs. As a consequence, the 2+-star packing problem is NP-hard even in bipartite graphs with maximum degree at most 4. Let T and t be two positive integers with T > t. An ℋ-packing is called a T\t-star packing if ℋ={K1,1,K1,2,…,K1,T}\{K1,t}. For t ≥ 2, we present a t/t+1-approximation algorithm for the T\t-star packing problem that runs in 𝒪(mn1/2) time, where n is the number of vertices and m the number of edges of the input graph. We also design a 1/2-approximation algorithm for the 2+-star packing problem that runs in 𝒪(m) time, where m is the number of edges of the input graph. As a consequence, every connected graph with at least 3 vertices has a 2+-star packing that covers at least half of its vertices.
Funder
National Natural Science Foundation of China
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference12 articles.
1. Anstee R., Personal Communication to Pavol Hell (1996).
2. Bahenko M. and Gusakov A., New exact and approximation algorithms for the star packing problem in undirected graphs. In: 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. March 10–12, 2011, Dortmund, Germany (2011) 519–530.
3. Oriented star packings
4. Complexity of approximating bounded variants of optimization problems
5. Garey M.R. and Johnson D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Packing 2- and 3-stars into cubic graphs;Applied Mathematics and Computation;2024-01