The DOI matches its Crossref record; 46 of the 46 references it cites were found in a registry or an index.
Parameterized Complexity and Approximation Algorithms
Abstract
Approximation algorithms and parameterized complexity are usually considered to be two separate ways of dealing with hard algorithmic problems. In this paper, our aim is to investigate how these two fields can be combined to achieve better algorithms than what any of the two theories could offer. We discuss the different ways parameterized complexity can be extended to approximation algorithms, survey results of this type and propose directions for future research. 1.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Diestel, R. (1997) · Cited by 5,082
Fellows, M. R. (2002) · Electronic Notes in Theoretical Computer Science · doi:10.1016/s1571-0661(04)00301-9 · Cited by 2,836
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Some optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
Parameterized Complexity Theory
(2006) · Texts in Theoretical Computer Science. An EATCS Series · doi:10.1007/3-540-29953-x · Cited by 1,869
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
Bodlaender, H. L. (1996) · SIAM Journal on Computing · doi:10.1137/s0097539793251219 · Cited by 1,542
Which Problems Have Strongly Exponential Complexity?
Impagliazzo, R., Paturi, R., & Zane, F. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1774 · Cited by 1,331
Graph Minors .XIII. The Disjoint Paths Problem
Robertson, N., & Seymour, P. D. (1995) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.1995.1006 · Cited by 1,262
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Arora, S. (1998) · Journal of the ACM · doi:10.1145/290179.290180 · Cited by 1,137
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
Christofides, N. (2022) · Operations Research Forum · doi:10.1007/s43069-021-00101-z · Cited by 1,131
Every planar map is four colorable
Appel, K., & Haken, W. (1976) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1976-14122-5 · Cited by 1,109
Ausiello, G., Marchetti-Spaccamela, A., Crescenzi, P., Gambosi, G., Protasi, M., & Kann, V. (1999) · Springer eBooks · doi:10.1007/978-3-642-58412-1 · Cited by 979
Approximation algorithms for NP-complete problems on planar graphs
Baker, B. S. (1994) · Journal of the ACM · doi:10.1145/174644.174650 · Cited by 947
Vertex cover might be hard to approximate to within 2−ε
Khot, S., & Regev, O. (2007) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2007.06.019 · Cited by 795
Planar Formulae and Their Uses
Lichtenstein, D. (1982) · SIAM Journal on Computing · doi:10.1137/0211025 · Cited by 769
Vertex packings: Structural properties and algorithms
Nemhauser, G. L., & Trotter, L. E. (1975) · Mathematical Programming · doi:10.1007/bf01580444 · Cited by 664
Applications of a Planar Separator Theorem
Lipton, R. J., & Tarjan, R. E. (1980) · SIAM Journal on Computing · doi:10.1137/0209046 · Cited by 640
Finding and counting given length cycles
Alon, N., Yuster, R., & Zwick, U. (1997) · Algorithmica · doi:10.1007/bf02523189 · Cited by 608
A survey of graph layout problems
Díaz, J., Petit, J., & Serna, M. (2002) · ACM Computing Surveys · doi:10.1145/568522.568523 · Cited by 599
On coresets for k-means and k-median clustering
Har-Peled, S., & Mazumdar, S. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007400 · Cited by 527
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
Arora, S. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548458 · Cited by 449
The Traveling Salesman Problem with Distances One and Two
Papadimitriou, C. H., & Yannakakis, M. (1993) · Mathematics of Operations Research · doi:10.1287/moor.18.1.1 · Cited by 412
Approximation schemes for Euclidean k-medians and related problems
Arora, S., Raghavan, P., & Rao, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276718 · Cited by 341
Zero Knowledge and the Chromatic Number
Feige, U., & Kilian, J. (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1587 · Cited by 334
A PTAS for the multiple knapsack problem
Chekuri, C., & Khanna, S. (2000) · ScholarlyCommons (University of Pennsylvania) · doi:10.5555/338219.338254 · Cited by 269
Label placement by maximum independent set in rectangles
Agarwal, P. K., van Kreveld, M., & Suri, S. (1998) · Computational Geometry · doi:10.1016/s0925-7721(98)00028-5 · Cited by 244
Exact and Approximation Algorithms for Clustering
Agarwal, P. K., & Procopiuc, C. M. (2002) · Algorithmica · doi:10.1007/s00453-001-0110-y · Cited by 242
The Parameterized Complexity of Counting Problems
Flum, J., & Grohe, M. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539703427203 · Cited by 232
The Approximability of Constraint Satisfaction Problems
Khanna, S., Sudan, M., Trevisan, L., & Williamson, D. P. (2001) · SIAM Journal on Computing · doi:10.1137/s0097539799349948 · Cited by 200
The hardness of approximation: Gap location
Petrank, E. (1994) · Computational Complexity · doi:10.1007/bf01202286 · Cited by 196
Finding approximate separators and computing tree width quickly
Reed, B. A. (1992) · Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92 · doi:10.1145/129712.129734 · Cited by 179
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., & Wernicke, S. (2006) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2006.02.001 · Cited by 162
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Courcelle, B., & Oum, S. (2006) · Journal of Combinatorial Theory Series B · doi:10.1016/j.jctb.2006.04.003 · Cited by 119
A Structural View on Parameterizing Problems: Distance from Triviality
Guo, J., Hüffner, F., & Niedermeier, R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28639-4_15 · Cited by 115
Linear FPT reductions and computational lower bounds
Chen, J., Huang, X., Kanj, I. A., & Xia, G. (2004) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1007352.1007391 · Cited by 109
Efficiently four-coloring planar graphs
Robertson, N., Sanders, D. P., Seymour, P. D., & Thomas, R. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.238005 · Cited by 107
Towards a syntactic characterization of PTAS
Khanna, S., & Motwani, R. (1996) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/237814.237979 · Cited by 97
A study on two geometric location problems
Wang, D. W., & Kuo, Y.-S. (1988) · Information Processing Letters · doi:10.1016/0020-0190(88)90174-3 · Cited by 91
Parameterized coloring problems on chordal graphs
Marx, D. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.10.008 · Cited by 65
Self-citationOn Exact and Approximation Algorithms for Distinguishing Substring Selection
Gramm, J., Guo, J., & Niedermeier, R. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45077-1_19 · Cited by 50
On The Parameterized Intractability Of Motif Search Problems*
Fellows, M. R., Gramm, J., & Niedermeier, R. (2006) · COMBINATORICA · doi:10.1007/s00493-006-0011-4 · Cited by 50
When Hamming Meets Euclid: The Approximability of Geometric TSP and Steiner Tree
Trevisan, L. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539799352735 · Cited by 47
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
Cai, L., & Huang, X. (2006) · Lecture notes in computer science · doi:10.1007/11847250_9 · Cited by 47
Improved Fixed-Parameter Algorithms for Two Feedback Set Problems
Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., & Wernicke, S. (2005) · Lecture notes in computer science · doi:10.1007/11534273_15 · Cited by 34
Cited by
Infeasibility of instance compression and succinct PCPs for NP
Fortnow, L., & Santhanam, R. (2011) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2010.06.007 · Cited by 288
Metadata
- Authors
- Marx, D.
- Venue
- The Computer Journal
- Publisher
- Oxford University Press (OUP)
- Published
- 2007-03-06
- Volume
- 51
- Issue
- 1
- Pages
- 60-78
- ISSN
- 0010-4620 (ISSN-L)
- 1460-2067
- OpenAlex
- W1980809300
- Cited by
- 283
- References
- 46
- FWCI
- 12.56
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.