Improved approximation algorithms for hitting 3-vertex paths
Article Properties
-
LanguageEnglish
-
DOI (url)
-
Publication Date2019/04/22
-
Journal
-
Indian UGC (journal)
-
Refrences12
-
Citations4
-
Samuel Fiorini
-
Gwenaël Joret ORCID (unauthenticated)
-
Oliver Schaudt
Cite
Fiorini, Samuel, et al. “Improved Approximation Algorithms for Hitting 3-Vertex Paths”. Mathematical Programming, vol. 182, no. 1-2, 2019, pp. 355-67, https://doi.org/10.1007/s10107-019-01395-y.
Fiorini, S., Joret, G., & Schaudt, O. (2019). Improved approximation algorithms for hitting 3-vertex paths. Mathematical Programming, 182(1-2), 355-367. https://doi.org/10.1007/s10107-019-01395-y
Fiorini, Samuel, Gwenaël Joret, and Oliver Schaudt. “Improved Approximation Algorithms for Hitting 3-Vertex Paths”. Mathematical Programming 182, no. 1-2 (2019): 355-67. https://doi.org/10.1007/s10107-019-01395-y.
Fiorini S, Joret G, Schaudt O. Improved approximation algorithms for hitting 3-vertex paths. Mathematical Programming. 2019;182(1-2):355-67.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Manufactures
Production management
Operations management
Technology
Technology (General)
Industrial engineering
Management engineering
Applied mathematics
Quantitative methods
You May Also Like
- A Singular Value Thresholding Algorithm for Matrix Completion
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- On the Implementation of a Primal-Dual Interior Point Method
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- An efficient augmented Lagrangian method with applications to total variation minimization
Refrences
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| A primal–dual approximation algorithm for the vertex cover P3 problem | Theoretical Computer Science |
| 47 | 2011 |
| Fixed-Parameter Algorithms for Cluster Vertex Deletion | Theory of Computing Systems |
| 41 | 2010 |
Local ratio | ACM Computing Surveys |
| 45 | 2004 |
| 10.1137/S0097539798338163 | SIAM Journal on Computing |
| 2001 | |
| 10.1016/S0167-6377(98)00021-2 | Operations Research Letters |
| 1998 |
Citations
| Title | Journal | Journal Categories | Citations | Publication Date |
|---|---|---|---|---|
| s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs | Discrete Applied Mathematics |
| 2024 | |
| On the d-Claw Vertex Deletion Problem | Algorithmica |
| 1 | 2023 |
| A tight approximation algorithm for the cluster vertex deletion problem | Mathematical Programming |
| 2 | 2022 |
| A New Direct Coefficient-Based Heuristic Algorithm for Set Covering Problems | International Journal of Fuzzy Systems |
| 4 | 2021 |
Citations Analysis
The category
Science: Mathematics 3
is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled A New Direct Coefficient-Based Heuristic Algorithm for Set Covering Problems and was published in 2021. The most recent citation comes from a 2024 study titled s-Club Cluster Vertex Deletion on interval and well-partitioned chordal graphs. This article reached its peak citation in 2024, with 1 citations. It has been cited in 4 different journals. Among related journals, the Discrete Applied Mathematics cited this research the most, with 1 citations. The chart below illustrates the annual citation trends for this article.