|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 41 occurrences of 34 keywords
|
|
|
Results
Found 68 publication records. Showing 68 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
69 | Stefan Hougardy |
Proof Checking and Non-approximability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 63-82, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
55 | Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot |
(Non)-Approximability for the Multi-criteria TSP(1, 2). ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 329-340, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
49 | Matthias Müller-Hannemann, Alexander Sonnikow |
Non-approximability of just-in-time scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 12(5), pp. 555-562, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Earliness, Non-approximability, Special cases, Single machine scheduling, Just-in-time, Tardiness |
49 | Noriyuki Fujimoto |
On Non-Approximability of Coarse-Grained Workflow Grid Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 9th International Symposium on Parallel Architectures, Algorithms, and Networks, ISPAN 2008, 7-9 May 2008, Sydney, NSW, Australia, pp. 127-132, 2008, IEEE Computer Society, 978-0-7695-3125-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
non-approximability, scheduling, grid computing, workflow |
44 | Beate Bollig, Martin Sauerhoff, Ingo Wegener |
On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the 16th Annual IEEE Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001, pp. 172-183, 2001, IEEE Computer Society, 0-7695-1053-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs |
37 | Maria J. Serna, Luca Trevisan, Fatos Xhafa |
The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings, pp. 488-498, 1998, Springer, 3-540-64230-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
35 | Davide Bilò, Luciano Gualà, Guido Proietti |
Improved approximability and non-approximability results for graph diameter decreasing problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 417, pp. 12-22, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
35 | Davide Bilò, Luciano Gualà, Guido Proietti |
Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2010, 35th International Symposium, MFCS 2010, Brno, Czech Republic, August 23-27, 2010. Proceedings, pp. 150-161, 2010, Springer, 978-3-642-15154-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
35 | Alberto Bertoni, Roberto Radicioni |
Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids. ![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. 72-83, 2007, Springer, 978-3-540-73207-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
35 | Christian Glaßer, Christian Reitwießner, Heinz Schmitz |
Multiobjective Disk Cover Admits a PTAS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 40-51, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Rodolphe Giroudeau, Jean-Claude König |
General Non-Approximability Results in Presence of Hierarchical Communications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPDC/HeteroPar ![In: 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), 3rd International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogenous Networks (HeteroPar 2004), 5-7 July 2004, Cork, Ireland, pp. 312-319, 2004, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
hierarchical communications, scheduling, nonapproximability |
32 | Luca Trevisan |
Non-approximability results for optimization problems on bounded degree instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 453-461, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger |
Non-approximability Results for Scheduling Problems with Minsum Criteria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 353-366, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
32 | Martin Mundhenk, Anna Slobodová |
Optimal Non-approximability of MAXCLIQUE. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 235-248, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
30 | Daniele Micciancio |
The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 92-98, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
non-approximability, Sauer's lemma, lattices, shortest vector problem |
23 | 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 |
|
23 | 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 |
|
23 | Lars Engebretsen |
The Non-approximability of Non-Boolean Predicates. ![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. 241-248, 2001, Springer, 3-540-42470-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | 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 |
|
19 | 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 |
|
19 | 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 |
|
19 | 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 |
|
19 | 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 |
|
19 | 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 |
|
19 | Zdenek Dvorák 0001, Ken-ichi Kawarabayashi |
Additive non-approximability of chromatic number in proper minor-closed classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1707.03888, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
19 | Mordecai J. Golin, Hadi Khodabande, Bo Qin |
Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1709.10307, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
19 | Mordecai J. Golin, Hadi Khodabande, Bo Qin |
Non-approximability and Polylogarithmic Approximations of the Single-Sink Unsplittable and Confluent Dynamic Flow Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand, pp. 41:1-41:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-054-5. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
19 | Xi Chen 0001, Xiaotie Deng |
Non-approximability of Bimatrix Nash Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Algorithms ![In: Encyclopedia of Algorithms - 2016 Edition, pp. 1412-1414, 2016, Springer, 978-1-4939-2863-7. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
19 | Frank Gurski, Magnus Roos |
Binary linear programming solutions and non-approximability for control problems in voting systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 162, pp. 391-398, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
19 | Marcel R. Ackermann, Johannes Blömer, Christoph Scholz 0001 |
Hardness and Non-Approximability of Bregman Clustering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR11, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
19 | Xi Chen 0001, Xiaotie Deng |
Non-approximability of Bimatrix Nash Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Algorithms ![In: Encyclopedia of Algorithms - 2008 Edition, 2008, Springer, 978-0-387-30770-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Rodolphe Giroudeau, Jean-Claude König |
General scheduling non-approximability results in presence of hierarchical communications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Oper. Res. ![In: Eur. J. Oper. Res. 184(2), pp. 441-457, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Birgit Schelm |
Average-Case Non-Approximability of Optimisation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(2), pp. 351-368, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Michael A. Ustinov |
Non-approximability of the Randomness Deficiency Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, CSR 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings, pp. 364-368, 2006, Springer, 3-540-34166-8. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
19 | Bodo Manthey |
Non-approximability of weighted multiple sequence alignment for arbitrary metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 95(3), pp. 389-395, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra |
On Non-Approximability for Quadratic Programs ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
19 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width II: non-approximability of clique-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
19 | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR05, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
19 | Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler, Muli Safra |
On Non-Approximability for Quadratic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings, pp. 206-215, 2005, IEEE Computer Society, 0-7695-2468-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Birgit Schelm |
Average-Case Non-approximability of Optimisation Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 409-421, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Craig A. Tovey |
Non-approximability of precedence-constrained sequencing to minimize setups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 134(1-3), pp. 351-360, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
19 | Bodo Manthey |
Non-approximability of weighted multiple sequence alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 296(1), pp. 179-192, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Vojtech Bálint |
The non-approximability of bicriteria network design problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 1(3-4), pp. 339-355, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Venkatesan Guruswami, Piotr Indyk |
Embeddings and non-approximability of geometric problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 537-538, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
19 | Christian Laforest |
Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial sub-cases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2003. Parallel Processing, 9th International Euro-Par Conference, Klagenfurt, Austria, August 26-29, 2003. Proceedings, pp. 903-910, 2003, Springer, 3-540-40788-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Venkatesan T. Chakaravarthy, Susan Horwitz |
On the non-approximability of points-to analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Acta Informatica ![In: Acta Informatica 38(8), pp. 587-598, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Bruno Codenotti, Igor E. Shparlinski |
Non-approximability of the Permanent of Structured Matrices over Finite Fields ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR02, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
19 | Noriyuki Fujimoto, Kenichi Hagihara |
Non-approximability of the Bulk Synchronous Task Scheduling Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings, pp. 225-233, 2002, Springer, 3-540-44049-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Eric Angel, Evripidis Bampis, Rodolphe Giroudeau |
Non-approximability Results for the Hierarchical Communication Problem with a Bounded Number of Clusters. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par ![In: Euro-Par 2002, Parallel Processing, 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002, Proceedings, pp. 217-224, 2002, Springer, 3-540-44049-6. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
19 | Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger |
Non-Approximability Results for Scheduling Problems with Minsum Criteria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 13(2), pp. 157-168, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Bodo Siebert |
Non-approximability of Weighted Multiple Sequence Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 7th Annual International Conference, COCOON 2001, Guilin, China, August 20-23, 2001, Proceedings, pp. 75-85, 2001, Springer, 3-540-42494-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Andrea E. F. Clementi, Luca Trevisan |
Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 225(1-2), pp. 113-128, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
19 | Oded Goldreich 0001, Shafi Goldwasser |
On the Limits of Non-Approximability of Lattice Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pp. 1-9, 1998, ACM, 0-89791-962-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
19 | Oded Goldreich 0001, Shafi Goldwasser |
On the Limits of Non-Approximability of Lattice Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR97, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP BibTeX RDF |
|
19 | Claus Rick, Hein Röhrig |
Deriving Non-approximability Results by Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Lectures on Proof Verification and Approximation Algorithms ![In: Lectures on Proof Verification and Approximation Algorithms. (the book grow out of a Dagstuhl Seminar, April 21-25, 1997), pp. 213-234, 1997, Springer, 3-540-64201-3. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
19 | Andrea E. F. Clementi, Luca Trevisan |
Improved Non-approximability Results for Minimum Vertex Cover with Density Constraints ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR96, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
|
19 | Andrea E. F. Clementi, Luca Trevisan |
Improved Non-approximability Results for Vertex Cover with Density Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, Second Annual International Conference, COCOON '96, Hong Kong, June 17-19, 1996, Proceedings, pp. 333-342, 1996, Springer, 3-540-61332-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
19 | Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 |
Free Bits, PCP and Non-Approximability - Towards Tight Results ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR95, 1995. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP BibTeX RDF |
|
19 | Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 |
Free Bits, PCPs and Non-Approximability - Towards Tight Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 422-431, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
free bits, logarithmic randomness, amortized free bits, Max Clique, Max-2-SAT, FGLSS connection, amortized free-bit complexity, amortized free bit complexity, FPCP parameters, triviality results, computational complexity, computational geometry, theorem proving, NP-hardness, NP complete problems, proof systems, chromatic number, PCPs, Max-cut, nonapproximability |
19 | Mihir Bellare, Madhu Sudan 0001 |
Improved non-approximability results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 23-25 May 1994, Montréal, Québec, Canada, pp. 184-193, 1994, ACM, 0-89791-663-8. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
14 | Dvir Shabtay, George Steiner |
Optimal due date assignment in multi-machine scheduling environments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Sched. ![In: J. Sched. 11(3), pp. 217-228, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Multi-machine scheduling, Complexity, Approximation, Due date assignment |
14 | Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer |
Unit disk graph approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DIALM-POMC ![In: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Philadelphia, PA, USA, October 1, 2004, pp. 17-23, 2004, ACM, 1-58113-921-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
sensor networks, ad hoc networks, embedding, unit disk graph, virtual coordinates |
12 | Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten |
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 862-873, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas |
12 | Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro |
Multicasting to Groups in Optical Networks and Related Combinatorial Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM/Abstracts Proceedings, pp. 223, 2003, IEEE Computer Society, 0-7695-1926-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
12 | Nitin Ahuja, Anand Srivastav |
On Constrained Hypergraph Coloring and Scheduling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002, Proceedings, pp. 14-25, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov |
Scheduling tasks with small communication delays for clusters of processors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001, pp. 314-315, 2001, ACM, 1-58113-409-6. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
12 | David P. Williamson |
Gadgets, Approximation, and Linear Programming: Improved Hardness Results for Cut and Satisfiability Problems (Abstract of Invited Lecture). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 1, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
12 | Pierluigi Crescenzi |
A Short Guide to Approximation Preserving Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, Ulm, Germany, June 24-27, 1997, pp. 262-273, 1997, IEEE Computer Society, 0-8186-7907-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
approximation preserving reductions, computational complexity, complexity, combinatorial optimization |
Displaying result #1 - #68 of 68 (100 per page; Change: )
|
|