Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
16 | Alba Muñoz, Fernando Rubio 0001 |
Evaluating Genetic Algorithms through the Approximability Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.00444, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Ferdinando Cicalese, Francesca Ugazio |
On the complexity and approximability of Bounded access Lempel Ziv coding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2403.15871, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Joshua Brakensiek, Neng Huang, Uri Zwick |
Tight approximability of MAX 2-SAT and relatives, under UGC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 1328-1344, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Henry L. Fleischmann, Surya Teja Gavva, Karthik C. S. |
On Approximability of Steiner Tree in ℓp-metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 1669-1703, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Tomer Ezra, Michal Feldman, Maya Schlesinger |
On the (In)approximability of Combinatorial Contracts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 15th Innovations in Theoretical Computer Science Conference, ITCS 2024, January 30 to February 2, 2024, Berkeley, CA, USA, pp. 44:1-44:22, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-309-6. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel |
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: 27th International Conference on Database Theory, ICDT 2024, March 25-28, 2024, Paestum, Italy, pp. 15:1-15:20, 2024, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-312-6. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
16 | Zdenek Dvorák 0001, Ken-ichi Kawarabayashi |
Additive non-approximability of chromatic number in proper minor-closed classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 158(Part), pp. 74-92, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet |
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Mach. Learn. Res. ![In: J. Mach. Learn. Res. 24, pp. 63:1-63:58, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
16 | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
Improved (In-)Approximability Bounds for d-Scattered Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 27(3), pp. 219-238, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Majid Khonji |
Approximability and efficient algorithms for constrained fixed-horizon POMDPs with durative actions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 323, pp. 103968, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru |
Corrigendum to "Complexity and approximability of the happy set problem" [Theor. Comput. Sci. 866 (2021) 123-144]. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 975, pp. 114114, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Yuqiao He, Guoliang Qiu 0001, Chihao Zhang 0001 |
Approximability of the complementarily symmetric Holant problems on cubic graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 975, pp. 114140, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Santiago Valdés Ravelo, Cristina G. Fernandes |
Complexity and approximability of Minimum Path-Collection Exact Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 942, pp. 21-32, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Amey Bhangale, Subhash Khot, Dor Minzer |
On Approximability of Satisfiable k-CSPs: II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
16 | Amey Bhangale, Subhash Khot, Dor Minzer |
On Approximability of Satisfiable k-CSPs: III. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
16 | Amey Bhangale, Subhash Khot, Dor Minzer |
On Approximability of Satisfiable k-CSPs: IV. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR23, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
16 | Holger Boche, Rafael F. Schaefer, H. Vincent Poor |
Algorithmic Computability and Approximability of Capacity-Achieving Input Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 69(9), pp. 5449-5462, September 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Tomer Ezra, Michal Feldman, Maya Schlesinger |
On the (In)approximability of Combinatorial Contracts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.18425, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Tobias Breiten, Bernhard Höveler |
On the approximability of Koopman-based operator Lyapunov equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.05187, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Panagiotis Aivasiliotis, Aris Pagourtzis |
On the Approximability of External-Influence-Driven Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.19251, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Youngkyu Lee, Jongho Park 0002, Chang-Ock Lee |
Balanced Group Convolution: An Improved Group Convolution Based on Approximability Estimates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.12461, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Zhiguo Fu, Tianyu Liu, Xiongxin Yang |
Approximability of the Four-Vertex Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2302.11336, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Welverton R. Silva, Fábio Luiz Usberti, Rafael C. S. Schouery |
On the approximability and energy-flow modeling of the electric vehicle sharing problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.12176, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Thomas Chen, Patricia Muñoz Ewald |
Non-approximability of constructive global L2 minimizers by gradient descent in Deep Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.07065, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Sophia Saller, Jana Koehler, Andreas Karrenbauer |
A Systematic Review of Approximability Results for Traveling Salesman Problems leveraging the TSP-T3CO Definition Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.00604, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Amey Bhangale, Subhash Khot, Dor Minzer |
On Approximability of Satisfiable k-CSPs: IV. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.16248, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Henry L. Fleischmann, Surya Teja Gavva, Karthik C. S. |
On Approximability of Steiner Tree in p-metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2306.02189, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Antoine Amarilli, Timothy van Bremen, Kuldeep S. Meel |
Conjunctive Queries on Probabilistic Graphs: The Limits of Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.13287, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Joshua Brakensiek, Neng Huang, Uri Zwick |
Tight approximability of MAX 2-SAT and relatives, under UGC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.12911, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Anders Martinsson |
On the approximability of the burning number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2308.04390, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Tobias Breiten, Bernhard Höveler |
On the Approximability of Koopman-Based Operator Lyapunov Equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Control. Optim. ![In: SIAM J. Control. Optim. 61(5), pp. 3131-3155, October 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Simon Foucart |
Full recovery from point values: an optimal algorithm for Chebyshev approximability prior. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 49(4), pp. 57, August 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Jayanth Bhargav, Mahsa Ghasemi, Shreyas Sundaram |
On the Complexity and Approximability of Optimal Sensor Selection for Mixed-Observable Markov Decision Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACC ![In: American Control Conference, ACC 2023, San Diego, CA, USA, May 31 - June 2, 2023, pp. 3332-3337, 2023, IEEE, 979-8-3503-2806-6. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Amey Bhangale, Subhash Khot, Dor Minzer |
On Approximability of Satisfiable k-CSPs: III. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 643-655, 2023, ACM, 978-1-4503-9913-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Amey Bhangale, Subhash Khot, Dor Minzer |
On Approximability of Satisfiable k-CSPs: II. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 632-642, 2023, ACM, 978-1-4503-9913-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
16 | Loay Mualem, Moran Feldman |
Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISTATS ![In: International Conference on Artificial Intelligence and Statistics, 25-27 April 2023, Palau de Congressos, Valencia, Spain., pp. 2542-2564, 2023, PMLR. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
16 | Martin Grohe, Venkatesan Guruswami, Dániel Marx, Stanislav Zivný |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Dagstuhl Reports ![In: Dagstuhl Reports 12(5), pp. 112-130, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Yen Hung Chen |
Approximability results for the $p$-centdian and the converse centdian problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 24(2), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Hiroshi Eto, Takehiro Ito, Zhilong Liu, Eiji Miyano |
Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 105-A(9), pp. 1211-1222, September 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Chien-Chung Huang, Naonori Kakimura, Simon Mauras, Yuichi Yoshida |
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 36(1), pp. 355-382, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Li-Hsuan Chen, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing |
On the Approximability of the Single Allocation p-Hub Center Problem with Parameterized Triangle Inequality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(7), pp. 1993-2027, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Marinus Gottschau, Marilena Leichter |
Minimum Hitting Set of Interval Bundles Problem: Computational Complexity and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(8), pp. 2222-2239, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Antonis Antonopoulos, Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis, Petros Pantavos, Stathis Zachos |
Completeness, approximability and exponential time results for counting problems with easy decision version. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 915, pp. 55-73, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Xujin Chen, Minming Li, Changjun Wang, Chenhao Wang 0001, Mengqi Zhang, Yingchao Zhao 0001 |
Mechanisms for dual-role-facility location games: Truthfulness and approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 932, pp. 69-83, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Louis Dublois, Tesshu Hanaka, Mehdi Khosravian Ghadikolaei, Michael Lampis, Nikolaos Melissinos |
(In)approximability of maximum minimal FVS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 124, pp. 26-40, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Amey Bhangale, Subhash Khot, Dor Minzer |
On Approximability of Satisfiable k-CSPs: I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
16 | Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan 0001, Santhoshini Velusamy |
Sketching Approximability of (Weak) Monarchy Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR22, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
16 | Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann |
A Structural Investigation of the Approximability of Polynomial-Time Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.11681, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Holger Boche, Rafael F. Schaefer, H. Vincent Poor |
Algorithmic Computability and Approximability of Capacity-Achieving Input Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.12617, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
16 | Aleksa Stankovic |
Some Results on Approximability of Minimum Sum Vertex Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.11882, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Marten Maack, Simon Pukrop, Anna Rodriguez Rasmussen |
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.06171, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Simon Foucart |
Full Recovery from Point Values: an Optimal Algorithm for Chebyshev Approximability Prior. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.04985, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan 0001, Santhoshini Velusamy |
Sketching Approximability of (Weak) Monarchy Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.02345, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Loay Mualem, Moran Feldman |
Resolving the Approximability of Offline and Online Non-monotone DR-Submodular Maximization over General Convex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.05965, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Suprovat Ghoshal, Euiwoong Lee |
A Characterization of Approximability for Biased CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.04617, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
16 | Andrew James Turner, Ata Kabán |
Approximability and Generalisation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.07989, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Péter Györgyi, Tamás Kis |
New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 311, pp. 97-109, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Markus Faustmann, Jens Markus Melenk, Maryam Parvizi |
ℋ-matrix approximability of inverses of FEM matrices for the time-harmonic Maxwell equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 48(5), pp. 59, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Alexandre M. Bayen, Jesse Goodman, Eugene Vinitsky |
On the approximability of Time Disjoint Walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 44(3), pp. 1615-1636, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Piotr Wojciechowski 0002, K. Subramani 0001, Alvaro Velasquez, Matthew D. Williamson |
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALDAM ![In: Algorithms and Discrete Applied Mathematics - 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings, pp. 292-304, 2022, Springer, 978-3-030-95017-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Marten Maack, Simon Pukrop, Anna Rodriguez Rasmussen |
(In-)Approximability Results for Interval, Resource Restricted, and Low Rank Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany., pp. 77:1-77:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-247-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Künnemann |
A Structural Investigation of the Approximability of Polynomial-Time Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France., pp. 30:1-30:20, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-235-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Holger Boche, Rafael F. Schaefer, H. Vincent Poor |
Capacity-Achieving Input Distributions: Algorithmic Computability and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26 - July 1, 2022, pp. 2774-2779, 2022, IEEE, 978-1-6654-2159-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Yann Disser, David Weckbecker |
Unified Greedy Approximability Beyond Submodular Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCO ![In: Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers, pp. 299-311, 2022, Springer, 978-3-031-18529-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Elisabetta Punta |
First and Second Order Sliding Mode Equivalent Signals and Practical Approximability in the Implementation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VSS ![In: 16th International Workshop on Variable Structure Systems, VSS 2022, Rio de Janeiro, Brazil, September 11-14, 2022, pp. 1-5, 2022, IEEE, 978-1-6654-6359-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay |
Approximability of Robust Network Design: The Directed Case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 39th International Symposium on Theoretical Aspects of Computer Science, STACS 2022, March 15-18, 2022, Marseille, France (Virtual Conference)., pp. 6:1-6:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-222-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Antonios Antoniadis 0001, Sándor Kisfaludi-Bak, Bundit Laekhanukit, Daniel Vaz 0001 |
On the Approximability of the Traveling Salesman Problem with Line Neighborhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórshavn, Faroe Islands., pp. 10:1-10:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-236-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Amey Bhangale, Subhash Khot, Dor Minzer |
On approximability of satisfiable k-CSPs: I. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pp. 976-988, 2022, ACM, 978-1-4503-9264-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Euiwoong Lee, Suprovat Ghoshal |
A characterization of approximability for biased CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022, pp. 989-997, 2022, ACM, 978-1-4503-9264-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Aleksa Stankovic |
Some Results on Approximability of Minimum Sum Vertex Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 50:1-50:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan 0001, Santhoshini Velusamy |
Sketching Approximability of (Weak) Monarchy Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 35:1-35:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Ivan Bliznets, Danil Sagunov |
Two Generalizations of Proper Coloring: Hardness and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 28th International Conference, COCOON 2022, Shenzhen, China, October 22-24, 2022, Proceedings, pp. 82-93, 2022, Springer, 978-3-031-22104-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
16 | Martin Frohn |
On the approximability of the fixed-tree balanced minimum evolution problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 15(6), pp. 2321-2329, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Lintao Ye, Nathaniel Woodford, Sandip Roy 0002, Shreyas Sundaram |
On the Complexity and Approximability of Optimal Sensor Selection and Attack for Kalman Filtering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Autom. Control. ![In: IEEE Trans. Autom. Control. 66(5), pp. 2146-2161, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Yuma Tamura, Takehiro Ito, Xiao Zhou 0001 |
Approximability of the independent feedback vertex set problem for bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 849, pp. 227-236, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Yacine Al-Najjar, Walid Ben-Ameur, Jérémie Leguay |
On the approximability of robust network design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 860, pp. 41-50, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru |
Complexity and approximability of the happy set problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 866, pp. 123-144, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann, Martin Koutecký |
A note on the approximability of deepest-descent circuit steps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 49(3), pp. 310-315, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Vaneet Aggarwal, Tian Lan, Suresh Subramaniam 0001, Maotong Xu |
On the Approximability of Related Machine Scheduling Under Arbitrary Precedence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Netw. Serv. Manag. ![In: IEEE Trans. Netw. Serv. Manag. 18(3), pp. 3706-3718, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Christer Bäckström, Peter Jonsson, Sebastian Ordyniak |
Cost-optimal Planning, Delete Relaxation, Approximability, and Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 70, pp. 169-204, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Chi-Ning Chou, Alexander Golovnev, Madhu Sudan 0001, Santhoshini Velusamy |
Approximability of all finite CSPs in the dynamic streaming setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Chi-Ning Chou, Alexander Golovnev, Madhu Sudan 0001, Santhoshini Velusamy |
Classification of the streaming approximability of Boolean CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR21, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Sounaka Mishra, B. Arjuna Krishna, Shijin Rajakrishnan |
Approximability of open k-monopoly problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 65(5), pp. 798-814, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Jihao Long, Lei Wu |
Linear approximability of two-layer neural networks: A comprehensive analysis based on spectral decay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.04964, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Théophile Chaumont-Frelet, Padtrick Vega |
Frequency-explicit approximability estimates for time-harmonic Maxwell's equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.03393, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Marcelo Arenas, Pablo Barceló, Leopoldo E. Bertossi, Mikaël Monet |
On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.08015, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Dimitris Fotakis 0001, Panagiotis Kostopanagiotis, Vasileios Nakos, Georgios Piliouras, Stratis Skoulakis |
On the Approximability of Multistage Min-Sum Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2107.13344, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Chi-Ning Chou, Alexander Golovnev, Madhu Sudan 0001, Santhoshini Velusamy |
Approximability of all finite CSPs in the dynamic streaming setting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2105.01161, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Markus Faustmann, Jens Markus Melenk, Maryam Parvizi |
$\mathcal{H}$-matrix approximability of inverses of FEM matrices for the time-harmonic Maxwell equations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2103.14981, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Joanna Boyland, Michael Hwang, Tarun Prasad, Noah Singer, Santhoshini Velusamy |
Closed-form expressions for the sketching approximability of (some) symmetric Boolean CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.06319, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Chi-Ning Chou, Alexander Golovnev, Madhu Sudan 0001, Santhoshini Velusamy |
Classification of the streaming approximability of Boolean CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.12351, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Jean Cardinal, Justin Dallant, John Iacono |
Approximability of (Simultaneous) Class Cover for Boxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.12969, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Alba Muñoz, Fernando Rubio 0001 |
Evaluating genetic algorithms through the approximability hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. ![In: J. Comput. Sci. 53, pp. 101388, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Simon Foucart |
Instances of computational optimal recovery: Refined approximability models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Complex. ![In: J. Complex. 62, pp. 101503, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Martijn van Ee |
Approximability of the dispersed p→-neighbor k-supplier problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 289, pp. 219-229, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Spoorthy Gunda, Pallavi Jain 0001, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale |
On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 13(4), pp. 27:1-27:40, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Santiago Valdés Ravelo |
Minimum constellation covers: hardness, approximability and polynomial cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 41(3), pp. 603-624, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Xianmin Liu, Yingshu Li, Jianzhong Li 0001, Yuqiang Feng |
On the complexity and approximability of repair position selection problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 42(3), pp. 354-372, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee |
On Approximability of Clustering Problems Without Candidate Centers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pp. 2635-2648, 2021, SIAM, 978-1-61197-646-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Chi-Ning Chou, Alexander Golovnev, Madhu Sudan 0001, Santhoshini Velusamy |
Approximability of all finite CSPs with linear sketches. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022, pp. 1197-1208, 2021, IEEE, 978-1-6654-2055-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|