Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
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) |
ICALP ![In: 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)., pp. 65:1-65:19, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-195-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
16 | Jean Cardinal, Justin Dallant, John Iacono |
Approximability of (Simultaneous) Class Cover for Boxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCCG ![In: Proceedings of the 33rd Canadian Conference on Computational Geometry, CCCG 2021, August 10-12, 2021, Dalhousie University, Halifax, Nova Scotia, Canada, pp. 149-156, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
16 | Erwin Pesch, Katarzyna Anna Kuzmicz |
Non-approximability of the single crane container transhipment problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Prod. Res. ![In: Int. J. Prod. Res. 58(13), pp. 3965-3975, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | S. Rasoul Etesami 0001 |
Complexity and Approximability of Optimal Resource Allocation and Nash Equilibrium over Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Optim. ![In: SIAM J. Optim. 30(1), pp. 885-914, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Holger Boche, Rafael F. Schaefer, H. Vincent Poor |
Shannon meets Turing: Non-computability and non-approximability of the finite state channel capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. Inf. Syst. ![In: Commun. Inf. Syst. 20(2), pp. 81-116, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Mahmood Ettehad, Simon Foucart |
Approximability models and optimal system identification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Control. Signals Syst. ![In: Math. Control. Signals Syst. 32(1), pp. 19-41, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Miriam Backens, Leslie Ann Goldberg |
Holant Clones and the Approximability of Conservative Holant Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 16(2), pp. 23:1-23:55, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Praveen Kalarickel Ramakrishnan, Mirco Raffetto |
Well Posedness and Finite Element Approximability of Three-Dimensional Time-Harmonic Electromagnetic Problems Involving Rotating Axisymmetric Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 12(2), pp. 218, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Geoffrey Solano, Guillaume Blin, Mathieu Raffinot, Jhoirene B. Clemente, Jaime Caro |
On the Approximability of the Minimum Weight $t$-partite Clique Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 24(3), pp. 171-190, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora |
Weighted Upper Edge Cover: Complexity and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 24(2), pp. 65-88, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Michael Yu. Khachay, Katherine Neznakhina |
Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 88(1-3), pp. 53-69, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Refael Hassin, R. Ravi 0001, F. Sibel Salman, Danny Segev |
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 82(9), pp. 2474-2501, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Robert Chiang, Kanstantsin Pashkovich |
On the Approximability of the Stable Matching Problem with Ties of Size Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 82(9), pp. 2668-2686, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Yann Disser, David Weckbecker |
Unified greedy approximability beyond submodular maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.00962, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2002.05477, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2003.11951, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Natalie Collina, S. Matthew Weinberg |
On the (in)-approximability of Bayesian Revenue Maximization for a Combinatorial Buyer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.05164, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2008.12075, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2006.10364, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2010.00087, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2010.10809, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis |
Characterizations and approximability of hard counting classes below #P. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2003.02524, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP 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) |
CoRR ![In: CoRR abs/2009.09971, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Simon Foucart |
Instances of Computational Optimal Recovery: Refined Approximability Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2004.00195, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Holger Boche, Rafael F. Schaefer, H. Vincent Poor |
Shannon Meets Turing: Non-Computability and Non-Approximability of the Finite State Channel Capacity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2008.13270, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik |
Refined bounds for algorithm configuration: The knife-edge of dual class approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.11827, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Ralph Abboud, Ismail Ilkan Ceylan, Radoslav Dimitrov |
On the Approximability of Weighted Model Integration on DNF Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.06726, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Yen Hung Chen |
Approximability results for the p-centdian and the converse centdian problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2011.00130, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Jochen Könemann, Kanstantsin Pashkovich, Natig Tofigzade |
On the Approximability of the Stable Matching Problem with Ties of Constant Size up to the Integrality Gap. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.05228, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Yacine Al-Najjar, Walid Ben-Ameur, Jeremie Leguay |
On the Approximability of Robust Network Design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.12291, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Chulhee Yun, Yin-Wen Chang, Srinadh Bhojanapalli, Ankit Singh Rawat, Sashank J. Reddi, Sanjiv Kumar |
$O(n)$ Connections are Expressive Enough: Universal Approximability of Sparse Transformers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.04862, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Mohammad Reza Kazemi 0001, Ali Mohades, Payam Khanteimouri |
On approximability of minimum color-spanning ball in high dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 279, pp. 188-191, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau |
Domination chain: Characterisation, classical complexity, parameterised complexity and approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 280, pp. 23-42, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
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) |
ISAAC ![In: 31st International Symposium on Algorithms and Computation, ISAAC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 3:1-3:14, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-173-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Daniel Lokshtanov, M. S. Ramanujan 0001, Saket Saurabh 0001, Meirav Zehavi |
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp. 2181-2200, 2020, SIAM, 978-1-61197-599-4. The full citation details ...](Pics/full.jpeg) |
2020 |
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) |
WALCOM ![In: WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Singapore, March 31 - April 2, 2020, Proceedings, pp. 286-295, 2020, Springer, 978-3-030-39880-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Eleni Bakali, Aggeliki Chalki, Aris Pagourtzis |
Characterizations and Approximability of Hard Counting Classes Below \(\#\mathsf {P}\). ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 16th International Conference, TAMC 2020, Changsha, China, October 18-20, 2020, Proceedings., pp. 251-262, 2020, Springer, 978-3-030-59266-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Natalie Collina, S. Matthew Weinberg |
On the (in-)approximability of Bayesian Revenue Maximization for a Combinatorial Buyer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: EC '20: The 21st ACM Conference on Economics and Computation, Virtual Event, Hungary, July 13-17, 2020, pp. 477-497, 2020, ACM, 978-1-4503-7975-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Peter Damaschke |
Two Robots Patrolling on a Line: Integer Version and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 31st International Workshop, IWOCA 2020, Bordeaux, France, June 8-10, 2020, Proceedings, pp. 211-223, 2020, Springer, 978-3-030-48965-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Chulhee Yun, Yin-Wen Chang, Srinadh Bhojanapalli, Ankit Singh Rawat, Sashank J. Reddi, Sanjiv Kumar |
O(n) Connections are Expressive Enough: Universal Approximability of Sparse Transformers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeurIPS ![In: Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual., 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Ralph Abboud, Ismail Ilkan Ceylan, Radoslav Dimitrov |
On the Approximability of Weighted Model Integration on DNF Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, September 12-18, 2020., pp. 828-837, 2020, 978-0-9992411-7-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Neng Huang, Aaron Potechin |
On the Approximability of Presidential Type Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 58:1-58:20, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
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) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020, August 17-19, 2020, Virtual Conference., pp. 51:1-51:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-164-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon 0001 |
Scheduling on Hybrid Platforms: Improved Approximability Window. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2020: Theoretical Informatics - 14th Latin American Symposium, São Paulo, Brazil, January 5-8, 2021, Proceedings, pp. 38-49, 2020, Springer, 978-3-030-61791-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Yuichi Asahiro, Hiroshi Eto, Tesshu Hanaka, Guohui Lin, Eiji Miyano, Ippei Terabaru |
Graph Classes and Approximability of the Happy Set Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings, pp. 335-346, 2020, Springer, 978-3-030-58149-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Jin-Yi Cai, Tianyu Liu 0002, Pinyan Lu, Jing Yu |
Approximability of the Eight-Vertex Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 35th Computational Complexity Conference, CCC 2020, July 28-31, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 4:1-4:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-156-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
16 | Maria-Florina Balcan, Tuomas Sandholm, Ellen Vitercik |
Refined bounds for algorithm configuration: The knife-edge of dual class approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event., pp. 580-590, 2020, PMLR. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
16 | Raghunath Reddy Madireddy, Apurva Mudgal |
Approximability and hardness of geometric hitting set with axis-parallel rectangles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 141, pp. 9-15, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Paz Carmi, Anil Maheshwari, Saeed Mehrabi 0001, Luís Fernando Schultz Xavier da Silveira |
Approximability of covering cells with line segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 784, pp. 133-141, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Tung-Wei Kuo |
On the approximability and hardness of the minimum connected dominating set with routing cost constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 793, pp. 140-151, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Dirk Oliver Theis |
Complexity and approximability of extended Spanning Star Forest problems in general and complete graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 775, pp. 1-15, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Neng Huang, Aaron Potechin |
On the Approximability of Presidential Type Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.04451, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
16 | Vincent Fagnon, Imed Kacem, Giorgio Lucarelli, Bertrand Simon 0001 |
Scheduling on Hybrid Platforms: Improved Approximability Window. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1912.03088, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
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) |
CoRR ![In: CoRR abs/1910.05589, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
16 | Katharina Dannenberg, Jesper Jansson 0001, Andrzej Lingas, Eva-Marta Lundell |
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 257, pp. 101-114, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Diogo Poças, Jeffery I. Zucker |
Approximability in the GPAC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 15(3), 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Grant Schoenebeck, Biaoshuai Tao |
Beyond Worst-case (In)approximability of Nonsubmodular Influence Maximization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Theory ![In: ACM Trans. Comput. Theory 11(3), pp. 12:1-12:56, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Michael Karkulik, Jens Markus Melenk |
H-matrix approximability of inverses of discretizations of the fractional Laplacian. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Comput. Math. ![In: Adv. Comput. Math. 45(5), pp. 2893-2919, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Wei Yu 0011, Zhaohui Liu 0001 |
Better approximability results for min-max tree/cycle/path cover problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 37(2), pp. 563-578, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Kameng Nip, Zhenbo Wang |
On the approximability of the two-phase knapsack problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 38(4), pp. 1155-1179, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti |
Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 38(1), pp. 165-184, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Jin-Yi Cai, Tianyu Liu 0002, Pinyan Lu |
Approximability of the Six-vertex Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 2248-2261, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Vijay Bhattiprolu, Mrinalkanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani |
Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 1358-1368, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora |
Weighted Upper Edge Cover: Complexity and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings, pp. 235-247, 2019, Springer, 978-3-030-10563-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora |
Correction to: Weighted Upper Edge Cover: Complexity and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings, 2019, Springer, 978-3-030-10563-1. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Yaonan Jin, Weian Li, Qi Qi 0003 |
On the Approximability of Simple Mechanisms for MHR Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Web and Internet Economics - 15th International Conference, WINE 2019, New York, NY, USA, December 10-12, 2019, Proceedings, pp. 228-240, 2019, Springer, 978-3-030-35388-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Huanyang Zheng, Ning Wang 0018, Jie Wu 0001 |
Non-Submodularity and Approximability: Influence Maximization in Online Social Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WOWMOM ![In: 20th IEEE International Symposium on `A World of Wireless, Mobile and Multimedia Networks`, WoWMoM 2019, Washington, DC, USA, June 10-12, 2019, pp. 1-9, 2019, IEEE, 978-1-7281-0270-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Yousef M. Alhamdan, Alexander V. Kononov |
Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings, pp. 1-12, 2019, Springer, 978-3-030-19954-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos |
Improved (In-)Approximability Bounds for d-Scattered Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 17th International Workshop, WAOA 2019, Munich, Germany, September 12-13, 2019, Revised Selected Papers, pp. 202-216, 2019, Springer, 978-3-030-39478-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Yu Bai 0017, Tengyu Ma 0001, Andrej Risteski |
Approximability of Discriminators Implies Diversity in GANs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLR (Poster) ![In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019, 2019, OpenReview.net. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
16 | Yukun Ding, Jinglan Liu, Jinjun Xiong, Yiyu Shi 0001 |
On the Universal Approximability and Complexity Bounds of Quantized ReLU Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLR (Poster) ![In: 7th International Conference on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019, 2019, OpenReview.net. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
16 | Majid Khonji, Ashkan Jasour, Brian C. Williams |
Approximability of Constant-horizon Constrained POMDP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, pp. 5583-5590, 2019, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
16 | Ali Aouad, Vivek F. Farias, Retsef Levi, Danny Segev |
The Approximability of Assortment Optimization Under Ranking Preferences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. ![In: Oper. Res. 66(6), pp. 1661-1669, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Martin Grohe, Venkatesan Guruswami, Stanislav Zivný |
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Dagstuhl Reports ![In: Dagstuhl Reports 8(6), pp. 1-18, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Samuel Fiorini, R. Krithika 0001, N. S. Narayanaswamy, Venkatesh Raman 0001 |
Approximability of Clique Transversal in Perfect Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 80(8), pp. 2221-2239, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Dimitri Watel, Alain Faye |
Taxi-sharing: Parameterized complexity and approximability of the dial-a-ride problem with money as an incentive. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 745, pp. 202-223, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Li-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Ralf Klasing, Chia-Wei Lee, Bang Ye Wu |
Approximability and inapproximability of the star p-hub center problem with parameterized triangle inequality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 92, pp. 92-112, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Felix Bauckholt, Kanstantsin Pashkovich, Laura Sanità |
On the approximability of the stable marriage problem with one-sided ties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.05391, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Alexandre M. Bayen, Jesse Goodman, Eugene Vinitsky |
On the Approximability of Time Disjoint Walks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.10837, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Flavien Breuvart |
Refining Properties of Filter Models: Sensibility, Approximability and Reducibility. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1801.05153, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Paz Carmi, Anil Maheshwari, Saeed Mehrabi 0001, Luís Fernando Schultz Xavier da Silveira |
Approximability of Covering Cells with Line Segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1809.09979, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Jin-Yi Cai, Tianyu Liu 0002, Pinyan Lu, Jing Yu |
Approximability of the Eight-vertex Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1811.03126, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Miriam Backens, Leslie Ann Goldberg |
Holant clones and the approximability of conservative holant problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1811.00817, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Yu Bai 0017, Tengyu Ma 0001, Andrej Risteski |
Approximability of Discriminators Implies Diversity in GANs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.10586, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis |
Covering with Clubs: Complexity and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.01119, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, Florian Sikora |
Weighted Upper Edge Cover: Complexity and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1811.02599, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Robert Chiang, Kanstantsin Pashkovich |
On the approximability of the stable matching problem with ties of size two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.04510, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Diogo Poças, Jeffery I. Zucker |
Approximability in the GPAC. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1801.07661, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Mattia D'Emidio, Luca Forlizzi, Daniele Frigioni, Stefano Leucci 0001, Guido Proietti |
Hardness, Approximability, and Fixed-Parameter Tractability of the Clustered Shortest-Path Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1801.10416, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Yukun Ding, Jinglan Liu, Yiyu Shi 0001 |
On the Universal Approximability of Quantized ReLU Neural Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.03646, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
16 | Borzou Rostami, André B. Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli, Marc Goerigk |
The quadratic shortest path problem: complexity, approximability, and solution methods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 268(2), pp. 473-485, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Stefan Canzar, Khaled M. Elbassioni, Amr Elmasry, Rajiv Raman 0001 |
On the approximability of the maximum interval constrained coloring problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 27, pp. 57-72, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Marin Bougeret, Guillerme Duvillié, Rodolphe Giroudeau |
Approximability and exact resolution of the multidimensional binary vector assignment problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 36(3), pp. 1059-1073, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Giorgio Ausiello, Vangelis Th. Paschos |
Reductions That Preserve Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Handbook of Approximation Algorithms and Metaheuristics (1) ![In: Handbook of Approximation Algorithms and Metaheuristics, Second Edition, Volume 1: Methologies and Traditional Applications, pp. 243-258, 2018, Chapman and Hall/CRC, 9781351236423. The full citation details ...](Pics/full.jpeg) |
2018 |
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) |
ICALP ![In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pp. 47:1-47:12, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-076-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Lintao Ye, Sandip Roy 0002, Shreyas Sundaram |
On the Complexity and Approximability of Optimal Sensor Selection for Kalman Filtering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACC ![In: 2018 Annual American Control Conference, ACC 2018, Milwaukee, WI, USA, June 27-29, 2018, pp. 5049-5054, 2018, IEEE, 978-1-5386-5428-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Holger Boche, Volker Pohl |
On the Approximability of the Hilbert Transform. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIT ![In: 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, June 17-22, 2018, pp. 2530-2534, 2018, IEEE, 978-1-5386-4781-3. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Tung-Wei Kuo |
On the Approximability and Hardness of the Minimum Connected Dominating Set with Routing Cost Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALGOSENSORS ![In: Algorithms for Sensor Systems - 14th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018, Helsinki, Finland, August 23-24, 2018, Revised Selected Papers, pp. 32-46, 2018, Springer, 978-3-030-14093-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
16 | Riccardo Dondi, Giancarlo Mauri, Florian Sikora, Italo Zoppis |
Covering with Clubs: Complexity and Approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, July 16-19, 2018, Proceedings, pp. 153-164, 2018, Springer, 978-3-319-94666-5. The full citation details ...](Pics/full.jpeg) |
2018 |
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) |
COCOA ![In: Combinatorial Optimization and Applications - 12th International Conference, COCOA 2018, Atlanta, GA, USA, December 15-17, 2018, Proceedings, pp. 62-78, 2018, Springer, 978-3-030-04650-7. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|