Parameterized Algorithms for Covering by Arithmetic Progressions
Pages 125 - 138
Abstract
An arithmetic progression is a sequence of integers in which the difference between any two consecutive elements is the same. We investigate the parameterized complexity of two problems related to arithmetic progressions, called Cover by Arithmetic Progressions (CAP) and Exact Cover by Arithmetic Progressions (XCAP). In both problems, we are given a set X consisting of n integers along with an integer k, and our goal is to find k arithmetic progressions whose union is X. In XCAP we additionally require the arithmetic progressions to be disjoint. Both problems were shown to be NP-complete by Heath [IPL’90].
We present a time algorithm for CAP and a time algorithm for XCAP. We also give a fixed parameter tractable algorithm for CAP parameterized below some guaranteed solution size. We complement these findings by proving that CAP is Strongly NP-complete in the field , if p is a prime number part of the input.
References
[1]
Agrawal M, Kayal N, and Saxena N Primes is in P Ann. Math. 2004 160 781-793
[2]
Basavaraju M, Francis MC, Ramanujan M, and Saurabh S Partially polynomial kernels for set cover and test cover SIAM J. Discret. Math. 2016 30 3 1401-1423
[3]
Bast, H., Storandt, S.: Frequency data compression for public transportation network algorithms. In: Proceedings of the International Symposium on Combinatorial Search, vol. 4, pp. 205–206 (2013)
[4]
Bast, H., Storandt, S.: Frequency-based search for public transit. In: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 13–22 (2014)
[5]
Björklund A, Husfeldt T, and Koivisto M Set partitioning via inclusion-exclusion SIAM J. Comput. 2009 39 2 546-563
[6]
Bringmann, K., Kozma, L., Moran, S., Narayanaswamy, N.S.: Hitting set in hypergraphs of low VC-dimension. CoRR abs/1512.00481 (2015). http://arxiv.org/abs/1512.00481
[7]
Bringmann, K., Nakos, V.: Top-k-convolution and the quest for near-linear output-sensitive subset sum. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J. (eds.) Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020, Chicago, IL, USA, 22–26 June 2020, pp. 982–995. ACM (2020).
[8]
Chan, T.M., Lewenstein, M.: Clustered integer 3SUM via additive combinatorics. In: Servedio, R.A., Rubinfeld, R. (eds.) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14–17 June 2015, pp. 31–40. ACM (2015).
[9]
Crittenden RB and Vanden Eynden C Any arithmetic progressions covering the first integers cover all integers Proc. Am. Math. Soc. 1970 24 3 475-481
[10]
Crowston R, Gutin G, Jones M, Raman V, and Saurabh S Parameterized complexity of MaxSat above average Theoret. Comput. Sci. 2013 511 77-84
[11]
Cygan M et al. Parameterized Algorithms 2015 Cham Springer
[12]
Frank A and Tardos E An application of simultaneous Diophantine approximation in combinatorial optimization Combinatorica 1987 7 1 49-65
[13]
Grobman W and Studwell T Data compaction and vector scan e-beam system performance improvement using a novel algorithm for recognition of pattern step and repeats J. Vac. Sci. Technol. 1979 16 6 1803-1808
[14]
Heath LS Covering a set with arithmetic progressions is NP-complete Inf. Process. Lett. 1990 34 6 293-298
[15]
Naor, M., Schulman, L.J., Srinivasan, A.: Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23–25 October 1995, pp. 182–191. IEEE Computer Society (1995).
Recommendations
Parameterized Bounded-Depth Frege Is not Optimal
A general framework for parameterized proof complexity was introduced by Dantchev et al. [2007]. There, the authors show important results on tree-like Parameterized Resolution---a parameterized version of classical Resolution---and their gap complexity ...
Approximability and parameterized complexity of multicover by c-intervals
c-Interval Multicover is Set Multicover with each input set being the disjoint union of c intervals (a c-interval).We show 2-Interval Multicover to be W1]-hard with respect to the parameter "number of 2-intervals used in the cover".We show 2-Interval ...
Parameterized complexity dichotomy for Steiner Multicut
We consider the Steiner Multicut problem, which asks, given an undirected graph G, a collection T = { T 1 , ź , T t } , T i ź V ( G ) , of terminal sets of size at most p, and an integer k, whether there is a set S of at most k edges or nodes such that ...
Comments
Information & Contributors
Information
Published In
Feb 2024
513 pages
ISBN:978-3-031-52112-6
DOI:10.1007/978-3-031-52113-3
- Editors:
- Henning Fernau,
- Serge Gaspers,
- Ralf Klasing
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 19 February 2024
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Jan 2025