|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 218 occurrences of 124 keywords
|
|
|
Results
Found 523 publication records. Showing 523 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
70 | Michael Elkin, David Peleg |
Strong Inapproximability of the Basic k-Spanner Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 636-647, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
65 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Uriel Feige, Mohammad R. Salavatipour |
Combination can be hard: approximability of the unique coverage problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 162-171, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Zhixiang Chen 0001, Richard H. Fowler, Bin Fu, Binhai Zhu |
On the inapproximability of the exemplar conserved interval distance problem of genomes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 15(2), pp. 201-221, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Exemplar conserved interval distance, Weak approximation, Approximation algorithm, Genome rearrangement, Inapproximability |
52 | Thomas Erlebach, Alexander Hall |
NP-Hardness of Broadcast Scheduling and Inapproximability of Single-Source Unsplittable Min-Cost Flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 7(3), pp. 223-241, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
approximation algorithm, NP-complete, inapproximability, resource augmentation, broadcast scheduling |
52 | Johan Håstad |
Some optimal inapproximability results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(4), pp. 798-859, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
NP-hard optimization problems, max-sat, linear equations, Inapproximability, probabilistically checkable proofs |
47 | Kord Eickmeyer, Martin Grohe, Magdalena Grüber |
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, 23-26 June 2008, College Park, Maryland, USA, pp. 8-18, 2008, IEEE Computer Society, 978-0-7695-3169-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
derandomisation, parameterized complexity, inapproximability |
47 | Michael Alekhnovich, Sanjeev Arora, Iannis Tourlakis |
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22-24, 2005, pp. 294-303, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Lovász-Schrijver matrix cuts, inapproximability, integrality gaps |
44 | Hermann Gruber, Markus Holzer 0001 |
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Developments in Language Theory ![In: Developments in Language Theory, 11th International Conference, DLT 2007, Turku, Finland, July 3-6, 2007, Proceedings, pp. 205-216, 2007, Springer, 978-3-540-73207-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
44 | Subhash Khot |
Guest column: inapproximability results via Long Code based PCPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGACT News ![In: SIGACT News 36(2), pp. 25-42, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Piotr Berman, Marek Karpinski |
On Some Tighter Inapproximability Results (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 200-209, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Approximation Hardness, Bounded Dependency Satisfiability, Breakpoint Graphs, Node Cover, Approximation Algorithms, Independent Set, MAX-CUT, Sorting by Reversals |
39 | Arnab Bhattacharyya 0001, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff |
Transitive-closure spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 932-941, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Allan Borodin, David Cashman, Avner Magen |
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 943-955, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
39 | Christopher Umans |
Hardness of Approximating Sigma2p Minimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 40th Annual Symposium on Foundations of Computer Science, FOCS '99, 17-18 October, 1999, New York, NY, USA, pp. 465-474, 1999, IEEE Computer Society, 0-7695-0409-4. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
computational complexity, hardness of approximation, logic minimization, dispersers, polynomial hierarchy |
39 | Chunmei Liu, Yinglei Song, Legand L. Burge III |
Parameterized lower bound and inapproximability of polylogarithmic string barcoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 16(1), pp. 39-49, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Polylogarithmic string barcoding, Parameterized lower bound, Inapproximability |
39 | Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani |
Inapproximability results for the lateral gene transfer problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(4), pp. 387-405, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Lateral gene transfer, Phylogeny, Inapproximability |
39 | Sanjeev Arora |
Reductions, Codes, PCPs, and Inapproximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 404-413, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
NP-hard functions, code-like Levin reduction, complexity assumption, positive fraction, 3-colorable graph, code-like reduction, computational complexity, graph theory, error correction codes, error-correcting codes, NP-hardness, codes, inapproximability, PCPs, hardness, approximation ratio |
34 | Zhou Xu 0001, Liang Xu |
Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 383-392, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
min-max vehicle routing, approximation algorithm, inapproximability, path covers |
34 | Omid Amini, Stéphane Pérennes, Ignasi Sau |
Hardness and Approximation of Traffic Grooming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 561-573, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
SONET ADM, Approximation Algorithms, Optical Networks, PTAS, inapproximability, Traffic Grooming, APX-hardness |
34 | Tommy Färnqvist, Peter Jonsson |
Bounded Tree-Width and CSP-Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 632-643, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Computational complexity, constraint satisfaction, homomorphism, inapproximability, relational structure |
34 | Jin-yi Cai, Hong Zhu 0004 |
Progress in Computational Complexity Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 20(6), pp. 735-750, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms |
34 | Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco |
Approximation Bounds for Black Hole Search Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems, 9th International Conference, OPODIS 2005, Pisa, Italy, December 12-14, 2005, Revised Selected Papers, pp. 261-274, 2005, Springer, 3-540-36321-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
black hole search, approximation algorithm, mobile agent, inapproximability, graph exploration |
34 | Oleg A. Prokopyev, Panos M. Pardalos |
Minimum elsilon-equivalent Circuit Size Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(4), pp. 495-502, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
minimum circuit size problem, natural properties, combinatorial optimization, approximation, inapproximability, Boolean circuits |
34 | Spyros Angelopoulos 0001 |
Order-Preserving Transformations and Greedy-Like Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, Second International Workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers, pp. 197-210, 2004, Springer, 3-540-24574-X. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
inapproximability results, facility location, dominating set, Priority algorithms |
34 | Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovic, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger |
On the Hardness of Constructing Minimal 2-Connected Spanning Subgraphs in Complete Graphs with Sharpened Triangle Inequality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings, pp. 59-70, 2002, Springer, 3-540-00225-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
minimum-cost biconnected spanning subgraph, Approximation algorithm, inapproximability, augmentation |
34 | John H. Reif |
Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 28(3), pp. 271-287, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Visibility problems, Gap-preserving reductions, Telecommunications, Terrains, Inapproximability, Art gallery |
31 | Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra |
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 573-582, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Jirí Matousek 0001, Anastasios Sidiropoulos |
Inapproximability for Metric Embeddings into R^d. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 405-413, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson |
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), October 20-23, 2007, Providence, RI, USA, Proceedings, pp. 329-337, 2007, IEEE Computer Society, 978-0-7695-3010-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
31 | Xujin Chen, Xiaodong Hu 0001, Tianping Shuai |
Inapproximability and approximability of maximal tree routing and coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 11(2), pp. 219-229, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
coloring, multicast routing, maximum independent set |
31 | Oded Regev 0001 |
Improved Inapproximability of Lattice and Coding Problems with Preprocessing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 7-10 July 2003, Aarhus, Denmark, pp. 363-370, 2003, IEEE Computer Society, 0-7695-1879-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
31 | Thomas Erlebach, Alexander Hall |
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 194-202, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
31 | Stephan J. Eidenbenz |
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 60-68, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Stephan J. Eidenbenz, Christoph Stamm, Peter Widmayer |
Inapproximability Results for Guarding Polygons and Terrains. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 31(1), pp. 79-113, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Christian Schindelhauer |
On the inapproximability of broadcasting time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000, Proceedings, pp. 226-237, 2000, Springer, 3-540-67996-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
31 | Christopher Umans |
On the Complexity and Inapproximability of Shortest Implicant Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 687-696, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
31 | Stephan J. Eidenbenz |
Inapproximability Results for Guarding Polygons without Holes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 427-436, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
31 | Liming Cai, David W. Juedes, Iyad A. Kanj |
The Inapproximability of Non NP-hard Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 437-446, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
31 | Johan Håstad |
Some Recent Strong Inapproximability Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '98, 6th Scandinavian Workshop on Algorithm Theory, Stockholm, Sweden, July, 8-10, 1998, Proceedings, pp. 205-209, 1998, Springer, 3-540-64682-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam |
Minimizing movement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(3), pp. 30:1-30:30, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
pebble placement, graphs, Motion planning, Euclidean plane |
26 | Guang Xu, Jinhui Xu 0001 |
An improved approximation algorithm for uncapacitated facility location problem with penalties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 17(4), pp. 424-436, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Algorithms, Approximation algorithms, Outliers, Facility location problem |
26 | Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao |
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 43(2), pp. 204-233, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Dijkstra’s algorithm, Most vital arcs problem, Cyclic game, Maxmin mean cycle, Minimal vertex cover, Network inhibition, Network interdiction, Approximation algorithm |
26 | Irit Dinur |
The PCP theorem by gap amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(3), pp. 12, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Gap amplification, PCP |
26 | Michael Elkin, David Peleg |
The Hardness of Approximating Spanner Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(4), pp. 691-729, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
26 | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam |
Minimizing movement. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 258-267, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
26 | Shmuel Safra, Oded Schwartz |
On the complexity of approximating tsp with neighborhoods and related problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(4), pp. 281-307, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
68Q25, Subject classification. 68Q17 |
26 | Vitaly Feldman |
Hardness of approximate two-level logic minimization and PAC learning with membership queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 363-372, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
DNF minimization, proper learning, two-level logic minimization, hardness of approximation, uniform distribution, membership queries, truth table |
26 | Zhixiang Chen 0001, Bin Fu, Binhai Zhu |
The Approximability of the Exemplar Breakpoint Distance Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management, Second International Conference, AAIM 2006, Hong Kong, China, June 20-22, 2006, Proceedings, pp. 291-302, 2006, Springer, 3-540-35157-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
26 | Sriram V. Pemmaraju, Rajiv Raman 0001 |
Approximation Algorithms for the Max-coloring Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 1064-1075, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Gregor Gramlich, Georg Schnitger |
Minimizing NFA's and Regular Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005, Proceedings, pp. 399-411, 2005, Springer, 3-540-24998-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
26 | Jérôme Monnot, Vangelis Th. Paschos, Dominique de Werra, Marc Demange, Bruno Escoffier |
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 896-907, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Amitai Armon, Yossi Azar, Leah Epstein |
Temporary Tasks Assignment Resolved. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 36(3), pp. 295-314, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Unrelated machines, Load balancing, Competitive, On-line, PTAS |
26 | Miroslav Chlebík, Janka Chlebíková |
Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, pp. 152-164, 2003, Springer, 3-540-40176-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Erik D. Demaine, Susan Hohenberger, David Liben-Nowell |
Tetris is Hard, Even to Approximate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 9th Annual International Conference, COCOON 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings, pp. 351-363, 2003, Springer, 3-540-40534-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Kasturi R. Varadarajan, Srinivasan Venkatesh 0001, Jiawei Zhang |
On Approximating the Radii of Point Sets in High Dimensions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 561-569, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Miroslav Chlebík, Janka Chlebíková |
Approximation Hardness of the Steiner Tree Problem on Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 170-179, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
26 | Adam R. Klivans |
On the Derandomization of Constant Depth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM-APPROX ![In: Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2001 and 5th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2001 Berkeley, CA, USA, August 18-20, 2001, Proceedings, pp. 249-260, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
26 | Johan Håstad |
Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings, pp. 235, 2000, Springer, 3-540-67715-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
26 | Michael Elkin, David Peleg |
The Hardness of Approximating Spanner Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2000, 17th Annual Symposium on Theoretical Aspects of Computer Science, Lille, France, February 2000, Proceedings, pp. 370-381, 2000, Springer, 3-540-67141-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
21 | Ola Svensson |
Conditional hardness of precedence constrained scheduling on identical machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 745-754, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
scheduling, approximation, inapproximability |
21 | Dániel Marx |
Completely Inapproximable Monotone and Antimonotone Parameterized Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 25th Annual IEEE Conference on Computational Complexity, CCC 2010, Cambridge, Massachusetts, USA, June 9-12, 2010, pp. 181-187, 2010, IEEE Computer Society, 978-0-7695-4060-3. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
parameterized comlexity, approximation, fixed-parameter tractability, inapproximability |
21 | Jan Arpe, Bodo Manthey |
Approximability of Minimum AND-Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(3), pp. 337-357, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Circuit design, Inapproximability |
21 | Hans-Joachim Böckenhauer, Juraj Hromkovic, Tobias Mömke, Peter Widmayer |
On the Hardness of Reoptimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings, pp. 50-65, 2008, Springer, 978-3-540-77565-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
reoptimization, approximation algorithms, inapproximability |
21 | Pi-Rong Sheu, Shan-Tai Chen |
On the Hardness of Approximating the Multicast Delay Variation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 56(11), pp. 1575-1577, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
inter-destination delay variation, NP-complete, NP-hard, multicast routing, Inapproximability |
21 | Per Austrin |
Balanced max 2-sat might not be the hardest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 189-197, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Max 2-Sat, inapproximability, unique games conjecture |
21 | Markus Bläser, Bodo Manthey |
Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(2), pp. 121-139, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Combinatorial optimization, Traveling salesman problem, Inapproximability, Cycle covers |
21 | Binwu Zhang, Jianzhong Zhang 0001, Yong He |
The Center Location Improvement Problem Under the Hamming Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 9(2), pp. 187-198, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
center location problem, Hamming distance, inapproximability |
21 | Oleg A. Prokopyev, Panos M. Pardalos |
On Approximability of Boolean Formula Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(2), pp. 129-135, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
minimum formula size problem, minimum circuit size problem, combinatorial optimization, approximation, inapproximability, Boolean formulas, Boolean circuits |
21 | Sanjoy Dasgupta, Wee Sun Lee, Philip M. Long |
A Theoretical Analysis of Query Selection for Collaborative Filtering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 51(3), pp. 283-298, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
approximation algorithms, recommender systems, collaborative filtering, inapproximability, membership queries |
18 | Guoliang Qiu 0001, Jiaheng Wang 0002 |
Inapproximability of counting independent sets in linear hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 184, pp. 106448, February 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Karthik C. S., Pasin Manurangsi |
On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR24, pp. TR24-007, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
18 | Shuichi Hirahara, Naoto Ohsaka |
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR24, pp. TR24-023, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP BibTeX RDF |
|
18 | Jérémi Do Dinh, Alexandros Hollender |
Tight Inapproximability of Nash Equilibria in Public Goods Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.14198, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Shuichi Hirahara, Naoto Ohsaka |
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2401.00474, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Naoto Ohsaka |
Tight Inapproximability of Target Set Reconfiguration. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.15076, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Jamie Tucker-Foltz |
Inapproximability of Unique Games in Fixed-Point Logic with Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 20(2), 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
18 | Alexander Meiburg |
Inapproximability of Positive Semidefinite Permanents and Quantum State Tomography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(12), pp. 3828-3854, December 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Pavel Dvorák, Andreas Emil Feldmann, Ashutosh Rai 0001, Pawel Rzazewski |
Parameterized Inapproximability of Independent Set in H-Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 85(4), pp. 902-928, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Venkatesan Guruswami, Xuandi Ren, Sai Sandeep |
Baby PIH: Parameterized Inapproximability of Min CSP. ![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 |
|
18 | Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu 0001 |
Parameterized Inapproximability Hypothesis under ETH. ![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 |
|
18 | Henry L. Fleischmann, Kyrylo Karlov, Karthik C. S., Ashwin Padaki, Stepan Zharkov |
Inapproximability of Maximum Diameter Clustering for Few Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.02097, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Alexander Kozachinskiy |
Inapproximability of sufficient reasons for decision trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2304.02781, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Karthik C. S., Pasin Manurangsi |
On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2312.17140, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Venkatesan Guruswami, Xuandi Ren, Sai Sandeep |
Baby PIH: Parameterized Inapproximability of Min CSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2310.16344, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Venkatesan Guruswami, Bingkai Lin, Xuandi Ren, Yican Sun, Kewen Wu 0001 |
Parameterized Inapproximability Hypothesis under ETH. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2311.16587, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Vijay Bhattiprolu, Mrinal Kanti Ghosh, Venkatesan Guruswami, Euiwoong Lee, Madhur Tulsiani |
Inapproximability of Matrix p → q Norms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 52(1), pp. 132-155, February 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Dongjing Miao, Pengfei Zhang, Jianzhong Li 0001, Ye Wang, Zhipeng Cai 0001 |
Approximation and inapproximability results on computing optimal repairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VLDB J. ![In: VLDB J. 32(1), pp. 173-197, January 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Jean Cardinal, Raphael Steiner |
Inapproximability of Shortest Paths on Perfect Matching Polytopes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 24th International Conference, IPCO 2023, Madison, WI, USA, June 21-23, 2023, Proceedings, pp. 72-86, 2023, Springer, 978-3-031-32725-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Pasin Manurangsi |
Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 14th Innovations in Theoretical Computer Science Conference, ITCS 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, USA., pp. 85:1-85:18, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-263-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
Tight Inapproximability for Graphical Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pp. 5600-5607, 2023, AAAI Press, 978-1-57735-880-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro 0002 |
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms. ![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. 553-566, 2023, ACM, 978-1-4503-9913-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Pál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman |
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, June 17-19, 2023, pp. 415-425, 2023, ACM, 978-1-4503-9545-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
18 | Naoto Ohsaka |
Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 73, pp. 709-735, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro 0002 |
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓp Norms. ![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 |
|
18 | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
Pure-Circuit: Strong Inapproximability for PPAD. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.15149, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Guoliang Qiu 0001, Jiaheng Wang |
Inapproximability of counting independent sets in linear hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2212.03072, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
Constant Inapproximability for PPA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.10011, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
18 | Pál András Papp, Georg Anegg, A. N. Yzelman |
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.08257, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Argyrios Deligkas, John Fearnley, Alexandros Hollender, Themistoklis Melissourgos |
Tight Inapproximability for Graphical Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.15151, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Pasin Manurangsi |
Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.01443, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
18 | Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro 0002 |
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all p Norms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.07900, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #100 of 523 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ >>] |
|