NSTL国家科技图书文献中心

1. Approximation hardness of domination problems on generalized convex graphs NSTL国家科技图书文献中心

Wang, Po Yuan | Kitamura, Naoki ... - 《Theoretical computer science》 - 2025,1028 - 共12页

摘要： subclasses. This study examines the approximation hardness | convex bipartite graphs. We explore the approximation | hardness for various domination problem variants | unbounded t or O results in APX-hardness* for all examined* | The domination problem and its variants in

关键词： Domination problem | Tree convex bipartite graph | Approximation hardness | Generalized convex graph

2. Finer-grained reductions in fine-grained hardness of approximation NSTL国家科技图书文献中心

Abboud, Elie | Ron-Zewi, Noga - 《Theoretical computer science》 - 2025,1026 - 共12页

摘要： approximation. Our reduction combines the hardness of | required for obtaining a (1 + S)-approximation* in time N* | )-approximation* algorithm for (bichromatic) Euclidean Closest* | (1 +S)-approximation* algorithm exists for Euclidean* | the approximation* guarantee of S e3 for Euclidean*

关键词： ALGORITHM | COMPLEXITY

3. On penalized reload cost path, walk, tour and maximum flow: hardness and approximation NSTL国家科技图书文献中心

Granata, Donatella - 《Optimization Letters》 - 2025,19(1) - 123～138 - 共16页

摘要：A meticulous description of a real network | with respect to its heterogeneous physical | infrastructure and properties is necessary for network design | assessment. Quantifying the costs of making these | structures work together effectively, and taking into

关键词： Reload cost | Approximability | NP-completeness | Penalized reload cost | Network design

4. Efficient Approximation of the CREM Gibbs Measure and the Hardness Threshold NSTL国家科技图书文献中心

Ho, Fu-Hsuan - 《Journal of Statistical Physics》 - 2025,192(3) - 共33页

摘要： exhibits a threshold beta(G) beta(G) , a hardness* result* | The continuous random energy model (CREM) is a | toy model of disordered systems introduced by Bovier | and Kurkova in 2004 based on previous work by | Derrida and Spohn in the 80s. In a recent paper by

关键词： Algorithmic hardness | Continuous random energy model | Gaussian process | Gibbs measure | Kullback-Leibler divergence | Spin glass

5. Affine optimal k -proper connected edge colorings NSTL国家科技图书文献中心

Barish, Robert D. | Shibuya, Tetsuo - 《Optimization Letters》 - 2025,19(1) - 151～168 - 共18页

摘要： randomized approximation* scheme can exist for approximating* | We introduce affine optimal k-proper connected | edge colorings as a variation on Fujita's notion of | optimal k-proper connected colorings (Fujita in Optim | Lett 14(6):1371-1380, 2020. https://doi.org/10.1007

关键词： Optimal proper connection number | Proper connection | Edge coloring | Optimization hardness | Approximation hardness | FPRAS

6. Hardness of Approximate Diameter: Now for Undirected Graphs NSTL国家科技图书文献中心

MINA DALIRROOYFARD | RAY LI ... - 《Journal of the ACM》 - 2025,72(1) - 6.1～6.32 - 共32页

摘要： simple folklore algorithm can output a 2-approximation | better approximation* is possible in near-linear time. A* | to strong hardness* results for diameter in directed* | > 0, a 2 1 k approximation* for diameter in* | particular, the simple linear time 2-approximation

关键词： Fine-grained complexity | hardness of approximation | graph diameter | undirected graphs

7. On approximating partial scenario set cover NSTL国家科技图书文献中心

Dimant, Shai Michael | Krumke, Sven O. - 《Theoretical computer science》 - 2025,1023 - 共18页

摘要：. We present two approximation* approaches. The first* | approximation for the general case, which we use as a | approximation for PSSC. | The Partial Scenario Set Cover problem (PSSC | ) generalizes the Partial Set Cover problem, which is itself a

关键词： Combinatorial optimization | Set cover | Partial cover | Approximation algorithm | NP-hardness

8. A Quantum Unique Games Conjecture NSTL国家科技图书文献中心

Hamoon Mousavi | Taro Spirig - 《16th Innovations in Theoretical Computer Science Conference,Part 3 of 3》 - Innovations in Theoretical Computer Science Conference - 2025, - 共16页

摘要：After the NP-hardness* of computational* | problems such as 3SAT and MaxCut was established, a | natural next step was to explore whether these problems | remain hard to approximate. While the quantum nonlocal | games extensions of some of these problems are known

关键词： Hardness of approximation | Quantum computing | Noncommutative constraint satisfaction problems | Fourier analysis

9. Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs NSTL国家科技图书文献中心

Doron-Arad, Ilan | Shachnai, Hadas - 《Discrete Applied Mathematics》 - 2025,361 - 453～464 - 共12页

摘要： work, the best possible approximation* guarantees for* | tight 2-approximation* for BMWIS on perfect graphs and* | -approximation* for BMWIS on perfect graphs using a Lagrangian* | approximation scheme (EPTAS). Thus, the existing PTAS for | We consider the classic budgeted maximum

关键词： Maximum independent set | Budgeted constrained maximization | Bipartite graph | Perfect graph | Hardness of approximation

10. Facility Location on High-Dimensional Euclidean Spaces NSTL国家科技图书文献中心

Euiwoong Lee | Kijun Shin - 《16th Innovations in Theoretical Computer Science Conference,Part 3 of 3》 - Innovations in Theoretical Computer Science Conference - 2025, - 共21页

摘要： better approximation* ratios than their general metric* | versions, their approximation* ratios are still higher* | than the hardness* ratios for general metrics, leaving* | approximation ratios will be the same between Euclidean and | admits a (γ, 1 + 2e~(-γ) - ε)-bifactor approximation

摘要： subclasses. This study examines the approximation hardness | convex bipartite graphs. We explore the approximation | hardness for various domination problem variants | unbounded t or O results in APX-hardness* for all examined* | The domination problem and its variants in

关键词： Domination problem | Tree convex bipartite graph | Approximation hardness | Generalized convex graph

摘要： approximation. Our reduction combines the hardness of | required for obtaining a (1 + S)-approximation* in time N* | )-approximation* algorithm for (bichromatic) Euclidean Closest* | (1 +S)-approximation* algorithm exists for Euclidean* | the approximation* guarantee of S e3 for Euclidean*

关键词： ALGORITHM | COMPLEXITY

摘要：A meticulous description of a real network | with respect to its heterogeneous physical | infrastructure and properties is necessary for network design | assessment. Quantifying the costs of making these | structures work together effectively, and taking into

关键词： Reload cost | Approximability | NP-completeness | Penalized reload cost | Network design

摘要： exhibits a threshold beta(G) beta(G) , a hardness* result* | The continuous random energy model (CREM) is a | toy model of disordered systems introduced by Bovier | and Kurkova in 2004 based on previous work by | Derrida and Spohn in the 80s. In a recent paper by

关键词： Algorithmic hardness | Continuous random energy model | Gaussian process | Gibbs measure | Kullback-Leibler divergence | Spin glass

摘要： randomized approximation* scheme can exist for approximating* | We introduce affine optimal k-proper connected | edge colorings as a variation on Fujita's notion of | optimal k-proper connected colorings (Fujita in Optim | Lett 14(6):1371-1380, 2020. https://doi.org/10.1007

关键词： Optimal proper connection number | Proper connection | Edge coloring | Optimization hardness | Approximation hardness | FPRAS

摘要： simple folklore algorithm can output a 2-approximation | better approximation* is possible in near-linear time. A* | to strong hardness* results for diameter in directed* | > 0, a 2 1 k approximation* for diameter in* | particular, the simple linear time 2-approximation

关键词： Fine-grained complexity | hardness of approximation | graph diameter | undirected graphs

摘要：. We present two approximation* approaches. The first* | approximation for the general case, which we use as a | approximation for PSSC. | The Partial Scenario Set Cover problem (PSSC | ) generalizes the Partial Set Cover problem, which is itself a

关键词： Combinatorial optimization | Set cover | Partial cover | Approximation algorithm | NP-hardness

摘要：After the NP-hardness* of computational* | problems such as 3SAT and MaxCut was established, a | natural next step was to explore whether these problems | remain hard to approximate. While the quantum nonlocal | games extensions of some of these problems are known

关键词： Hardness of approximation | Quantum computing | Noncommutative constraint satisfaction problems | Fourier analysis

摘要： work, the best possible approximation* guarantees for* | tight 2-approximation* for BMWIS on perfect graphs and* | -approximation* for BMWIS on perfect graphs using a Lagrangian* | approximation scheme (EPTAS). Thus, the existing PTAS for | We consider the classic budgeted maximum

关键词： Maximum independent set | Budgeted constrained maximization | Bipartite graph | Perfect graph | Hardness of approximation

关键词： Approximation algorithms | Clustering | Facility location

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： subclasses. This study examines the approximation hardness | convex bipartite graphs. We explore the approximation | hardness for various domination problem variants | unbounded t or O results in APX-hardness for all examined | The domination problem and its variants in

关键词： Domination problem | Tree convex bipartite graph | Approximation hardness | Generalized convex graph

摘要： approximation. Our reduction combines the hardness of | required for obtaining a (1 + S)-approximation in time N | )-approximation algorithm for (bichromatic) Euclidean Closest | (1 +S)-approximation algorithm exists for Euclidean | the approximation guarantee of S e3 for Euclidean

关键词： ALGORITHM | COMPLEXITY

摘要：A meticulous description of a real network | with respect to its heterogeneous physical | infrastructure and properties is necessary for network design | assessment. Quantifying the costs of making these | structures work together effectively, and taking into

关键词： Reload cost | Approximability | NP-completeness | Penalized reload cost | Network design

摘要： exhibits a threshold beta(G) beta(G) , a hardness result | The continuous random energy model (CREM) is a | toy model of disordered systems introduced by Bovier | and Kurkova in 2004 based on previous work by | Derrida and Spohn in the 80s. In a recent paper by

关键词： Algorithmic hardness | Continuous random energy model | Gaussian process | Gibbs measure | Kullback-Leibler divergence | Spin glass

摘要： randomized approximation scheme can exist for approximating | We introduce affine optimal k-proper connected | edge colorings as a variation on Fujita's notion of | optimal k-proper connected colorings (Fujita in Optim | Lett 14(6):1371-1380, 2020. https://doi.org/10.1007

关键词： Optimal proper connection number | Proper connection | Edge coloring | Optimization hardness | Approximation hardness | FPRAS

摘要： simple folklore algorithm can output a 2-approximation | better approximation is possible in near-linear time. A | to strong hardness results for diameter in directed | > 0, a 2 1 k approximation for diameter in | particular, the simple linear time 2-approximation

关键词： Fine-grained complexity | hardness of approximation | graph diameter | undirected graphs

摘要：. We present two approximation approaches. The first | approximation for the general case, which we use as a | approximation for PSSC. | The Partial Scenario Set Cover problem (PSSC | ) generalizes the Partial Set Cover problem, which is itself a

关键词： Combinatorial optimization | Set cover | Partial cover | Approximation algorithm | NP-hardness

摘要：After the NP-hardness of computational | problems such as 3SAT and MaxCut was established, a | natural next step was to explore whether these problems | remain hard to approximate. While the quantum nonlocal | games extensions of some of these problems are known

关键词： Hardness of approximation | Quantum computing | Noncommutative constraint satisfaction problems | Fourier analysis

摘要： work, the best possible approximation guarantees for | tight 2-approximation for BMWIS on perfect graphs and | -approximation for BMWIS on perfect graphs using a Lagrangian | approximation scheme (EPTAS). Thus, the existing PTAS for | We consider the classic budgeted maximum

关键词： Maximum independent set | Budgeted constrained maximization | Bipartite graph | Perfect graph | Hardness of approximation

摘要： better approximation ratios than their general metric | versions, their approximation ratios are still higher | than the hardness ratios for general metrics, leaving | approximation ratios will be the same between Euclidean and | admits a (γ, 1 + 2e~(-γ) - ε)-bifactor approximation

关键词： Approximation algorithms | Clustering | Facility location

4008-161-200 800-990-8900

国家科技图书文献中心

摘要： subclasses. This study examines the approximation hardness | convex bipartite graphs. We explore the approximation | hardness for various domination problem variants | unbounded t or O results in APX-hardness* for all examined* | The domination problem and its variants in

摘要： exhibits a threshold beta(G) beta(G) , a hardness* result* | The continuous random energy model (CREM) is a | toy model of disordered systems introduced by Bovier | and Kurkova in 2004 based on previous work by | Derrida and Spohn in the 80s. In a recent paper by

摘要： randomized approximation* scheme can exist for approximating* | We introduce affine optimal k-proper connected | edge colorings as a variation on Fujita's notion of | optimal k-proper connected colorings (Fujita in Optim | Lett 14(6):1371-1380, 2020. https://doi.org/10.1007

摘要： simple folklore algorithm can output a 2-approximation | better approximation* is possible in near-linear time. A* | to strong hardness* results for diameter in directed* | > 0, a 2 1 k approximation* for diameter in* | particular, the simple linear time 2-approximation

摘要：. We present two approximation* approaches. The first* | approximation for the general case, which we use as a | approximation for PSSC. | The Partial Scenario Set Cover problem (PSSC | ) generalizes the Partial Set Cover problem, which is itself a

摘要：After the NP-hardness* of computational* | problems such as 3SAT and MaxCut was established, a | natural next step was to explore whether these problems | remain hard to approximate. While the quantum nonlocal | games extensions of some of these problems are known

摘要： work, the best possible approximation* guarantees for* | tight 2-approximation* for BMWIS on perfect graphs and* | -approximation* for BMWIS on perfect graphs using a Lagrangian* | approximation scheme (EPTAS). Thus, the existing PTAS for | We consider the classic budgeted maximum