The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for Approximability with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1979-1994 (18) 1995-1996 (25) 1997 (21) 1998-1999 (31) 2000 (22) 2001 (28) 2002 (31) 2003 (31) 2004 (35) 2005 (38) 2006 (47) 2007 (51) 2008 (52) 2009 (49) 2010 (29) 2011 (35) 2012 (24) 2013 (34) 2014 (27) 2015 (35) 2016 (21) 2017 (43) 2018 (30) 2019 (25) 2020 (45) 2021 (30) 2022 (36) 2023 (30) 2024 (9)
Publication types (Num. hits)
article(467) book(3) incollection(19) inproceedings(428) phdthesis(13) proceedings(2)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 314 occurrences of 190 keywords

Results
Found 932 publication records. Showing 932 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
94Peter Jonsson, Johan Thapper Approximability of the Maximum Solution Problem for Certain Families of Algebras. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF computational complexity, approximability, Optimisation, constraint satisfaction, algebra
77Maxim Sviridenko, Gerhard J. Woeginger Approximability and in-approximability results for no-wait shop scheduling. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF in-approximability results, no-wait shop scheduling, makespan criterion, computational complexity, approximability, processor scheduling, polynomial time approximation scheme, polynomial approximation, APX-hard
68Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin 09441 Abstracts Collection - The Constraint Satisfaction Problem: Complexity and Approximability. Search on Bibsonomy The Constraint Satisfaction Problem: Complexity and Approximability The full citation details ... 2009 DBLP  BibTeX  RDF
68Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin 09441 Executive Summary - The Constraint Satisfaction Problem: Complexity and Approximability. Search on Bibsonomy The Constraint Satisfaction Problem: Complexity and Approximability The full citation details ... 2009 DBLP  BibTeX  RDF
61Tommy Färnqvist, Peter Jonsson, Johan Thapper Approximability Distance in the Space of H-Colourability Problems. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF graph H-colouring, computational complexity, approximability, optimisation, graph homomorphism
61Fredrik Kuivinen Approximability of Bounded Occurrence Max Ones. Search on Bibsonomy MFCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Bounded occurrence, Max Ones, Approximability, Matching, Constraint satisfaction problems
60Peter Jonsson, Fredrik Kuivinen, Gustav Nordh Approximability of Integer Programming with Generalised Constraints. Search on Bibsonomy CP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
60Stefan Hougardy Proof Checking and Non-approximability. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
52Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, Andrei A. Krokhin (eds.) The Constraint Satisfaction Problem: Complexity and Approximability, 25.10. - 30.10.2009 Search on Bibsonomy The Constraint Satisfaction Problem: Complexity and Approximability The full citation details ... 2009 DBLP  BibTeX  RDF
52Barnaby Martin, Jos Martin The complexity of positive first-order logic without equality II: The four-element case. Search on Bibsonomy The Constraint Satisfaction Problem: Complexity and Approximability The full citation details ... 2009 DBLP  BibTeX  RDF
52Ross Willard PP-DEFINABILITY IS CO-NEXPTIME-COMPLETE. Search on Bibsonomy The Constraint Satisfaction Problem: Complexity and Approximability The full citation details ... 2009 DBLP  BibTeX  RDF
52Matthew Valeriote, Simone Bova, Hubie Chen On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. Search on Bibsonomy The Constraint Satisfaction Problem: Complexity and Approximability The full citation details ... 2009 DBLP  BibTeX  RDF
50Martin Thimm On the Approximability of the Steiner Tree Problem. Search on Bibsonomy MFCS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Minimum Steiner tree, Gadget reduction, Lower bounds, Approximability
49Birgit Schelm Average-Case Non-Approximability of Optimisation Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
49Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot (Non)-Approximability for the Multi-criteria TSP(1, 2). Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
49Birgit Schelm Average-Case Non-approximability of Optimisation Problems. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
49Béla Csaba, Marek Karpinski, Piotr Krysta Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems. Search on Bibsonomy SODA The full citation details ... 2002 DBLP  BibTeX  RDF
49Maria J. Serna, Luca Trevisan, Fatos Xhafa The (Parallel) Approximability of Non-Boolean Satisfiability Problems and Restricted Integer Programming. Search on Bibsonomy STACS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
49Sanjeev Khanna, Madhu Sudan 0001, Luca Trevisan Constraint Satisfaction: The Approximability of Minimization Problems. Search on Bibsonomy CCC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF complete problems, computational classes, computational complexity, Approximation algorithms, combinatorial optimization
43Alberto Bertoni, Roberto Radicioni Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids. Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
38Matthias Müller-Hannemann, Alexander Sonnikow Non-approximability of just-in-time scheduling. Search on Bibsonomy J. Sched. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Earliness, Non-approximability, Special cases, Single machine scheduling, Just-in-time, Tardiness
38Noriyuki Fujimoto On Non-Approximability of Coarse-Grained Workflow Grid Scheduling. Search on Bibsonomy ISPAN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF non-approximability, scheduling, grid computing, workflow
38Christos H. Papadimitriou, Mihalis Yannakakis On the Approximability of Trade-offs and Optimal Access of Web Sources. Search on Bibsonomy FOCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Web sources, optimal access, cost criteria, Pareto curve, polynomially succinct curve, multiple linear objectives, cost-time-quality trade-off, information retrieval, World-Wide Web, computational complexity, complexity, approximability, optimisation, multiobjective optimization, information resources, trade-offs, combinatorial mathematics, combinatorial optimization problem, hyperplane
38Sanjeev Khanna, Rajeev Motwani 0001, Madhu Sudan 0001, Umesh V. Vazirani On Syntactic versus Computational Views of Approximability Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF computational classes, computational views, approximation classes, MAX SNP, structural results, approximability, syntactic
38Khaled M. Elbassioni, Rajiv Raman 0001, Saurabh Ray, René Sitters On the approximability of the maximum feasible subsystem problem with 0/1-coefficients. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
38Moshe Babaioff, Patrick Briest, Piotr Krysta On the Approximability of Combinatorial Exchange Problems. Search on Bibsonomy SAGT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
38Liming Cai, Xiuzhen Huang Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Yijia Chen, Martin Grohe, Magdalena Grüber On Parameterized Approximability. Search on Bibsonomy IWPEC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
38Fredrik Kuivinen Tight Approximability Results for the Maximum Solution Equation Problem over Zp. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
38Tiziana Calamoneri, Paola Vocca On the Approximability of the L(h, k)-Labelling Problem on Bipartite Graphs (Extended Abstract). Search on Bibsonomy SIROCCO The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
38Giulia Galbiati, Edoardo Amaldi On the Approximability of the Minimum Fundamental Cycle Basis Problem. Search on Bibsonomy WAOA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
38Beate Bollig, Martin Sauerhoff, Ingo Wegener On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs. Search on Bibsonomy CCC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Computational complexity, lower bounds, approximations, binary decision diagrams, branching programs
38Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger An Improved Lower Bound on the Approximability of Metric TSP and Approximation Algorithms for the TSP with Sharpened Triangle Inequality. Search on Bibsonomy STACS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
38Toshihiro Fujito On Approximability of the Independent/Connected Edge Dominating Set Problems. Search on Bibsonomy FSTTCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
38Viggo Kann Strong Lower Bounds on the Approximability of some NPO PB-Complete Maximization Problems. Search on Bibsonomy MFCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
38Edoardo Amaldi, Viggo Kann On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems. Search on Bibsonomy STACS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
34Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen Ruling Out Polynomial-Time Approximation Schemes for Hard Constraint Satisfaction Problems. Search on Bibsonomy CSR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF maximum constraint satisfaction, complexity, approximability
34Han Hoogeveen, Martin Skutella, Gerhard J. Woeginger Preemptive Scheduling with Rejection. Search on Bibsonomy ESA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF in-approximability, Scheduling, computational complexity, approximation algorithm, preemption, worst case ratio
34Sascha Ott Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2. Search on Bibsonomy WG The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Superstrings, lower bounds, approximability, APX-hardness
33Christian Glaßer, Christian Reitwießner, Heinz Schmitz Multiobjective Disk Cover Admits a PTAS. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
33Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor Asymmetric k-center is log* n-hard to approximate. Search on Bibsonomy J. ACM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF asymmetric k-center, metric k-center, Approximation algorithms, hardness of approximation
33Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor Asymmetric k-center is log* n-hard to approximate. Search on Bibsonomy STOC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF asymmetric k-center, metric k-center, approximation algorithms, hardness of approximation
31Davide Bilò, Luciano Gualà, Guido Proietti Improved approximability and non-approximability results for graph diameter decreasing problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
31Davide Bilò, Luciano Gualà, Guido Proietti Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems. Search on Bibsonomy MFCS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
31Marc Demange, Vangelis Th. Paschos The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems. Search on Bibsonomy Comput. Optim. Appl. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
27Binhai Zhu Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems. Search on Bibsonomy TAMC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Marcel Ochel, Berthold Vöcking Approximability of OFDMA Scheduling. Search on Bibsonomy ESA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Tomoko Izumi, Taisuke Izumi, Hirotaka Ono 0001, Koichi Wada 0001 Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. Search on Bibsonomy COCOON The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27John Abraham, Zhixiang Chen 0001, Richard H. Fowler, Bin Fu, Binhai Zhu On the Approximability of Some Haplotyping Problems. Search on Bibsonomy AAIM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
27Vladimir G. Deineko, Peter Jonsson, Mikael Klasson, Andrei A. Krokhin The approximability of MAX CSP with fixed-value constraints. Search on Bibsonomy J. ACM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Complexity of approximation, maximum constraint satisfaction, dichotomy, Monge properties, supermodularity
27Sylvain Guillemot Parameterized Complexity and Approximability of the SLCS Problem. Search on Bibsonomy IWPEC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
27Till Tantau Logspace Optimization Problems and Their Approximability Properties. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002 The Parameterized Approximability of TSP with Deadlines. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
27Xujin Chen, Xiaodong Hu 0001, Tianping Shuai Inapproximability and approximability of maximal tree routing and coloring. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF coloring, multicast routing, maximum independent set
27Takehiro Ito, Erik D. Demaine, Xiao Zhou 0001, Takao Nishizeki Approximability of Partitioning Graphs with Supply and Demand. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Jérôme Monnot On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF labeled matching, approximate algorithms, NP-complete, bipartite graphs, colored matching
27Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos Weighted Coloring: Further Complexity and Approximability Results. Search on Bibsonomy ICTCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF weighted coloring, line graph of bipartite graphs, Approximation algorithm, NP-complete problems, interval graphs, partial k-tree
27Till Tantau Logspace Optimization Problems and Their Approximability Properties. Search on Bibsonomy FCT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Alexander Grigoriev, Gerhard J. Woeginger Project scheduling with irregular costs: complexity, approximability, and algorithms. Search on Bibsonomy Acta Informatica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Rodolphe Giroudeau, Jean-Claude König General Non-Approximability Results in Presence of Hierarchical Communications. Search on Bibsonomy ISPDC/HeteroPar The full citation details ... 2004 DBLP  DOI  BibTeX  RDF hierarchical communications, scheduling, nonapproximability
27Nikhil Bansal 0001, Maxim Sviridenko New approximability and inapproximability results for 2-dimensional Bin Packing. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
27Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. Search on Bibsonomy WG The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Miroslav Chlebík, Janka Chlebíková On Approximability of the Independent Set Problem for Low Degree Graphs. Search on Bibsonomy SIROCCO The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
27Alexander Grigoriev, Gerhard J. Woeginger Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Antonio Miranda, Luz Torres, Jianer Chen On the Approximability of Multiprocessor Task Scheduling Problems. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Marek Karpinski Approximability of the Minimum Bisection Problem: An Algorithmic Challenge. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
27Gerhard J. Woeginger On the Approximability of Average Completion Time Scheduling under Precedence Constraints. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
27Luca Trevisan Non-approximability results for optimization problems on bounded degree instances. Search on Bibsonomy STOC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
27Bodo Siebert Non-approximability of Weighted Multiple Sequence Alignment. Search on Bibsonomy COCOON The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
27Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures. Search on Bibsonomy ISSAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
27Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger Non-approximability Results for Scheduling Problems with Minsum Criteria. Search on Bibsonomy IPCO The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
27Martin Mundhenk, Anna Slobodová Optimal Non-approximability of MAXCLIQUE. Search on Bibsonomy Lectures on Proof Verification and Approximation Algorithms The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
27Maria J. Serna, Fatos Xhafa The Parallel Approximability of a Subclass of Quadratic Programming. Search on Bibsonomy ICPADS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Parallel Approximation Algorithms, De-randomization, Quadratic Programming, Randomized Rounding
27David Fernández-Baca, Jens Lagergren On the Approximability of the Steiner Tree Problem in Phylogeny. Search on Bibsonomy ISAAC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
27Ian Barland, Phokion G. Kolaitis, Madhukar N. Thakur Integer Programming as a Framework for Optimization and Approximability. Search on Bibsonomy CCC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF structural complexity theory, approximation algorithms, combinatorial optimization, Integer Programming
27Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe Complexity and Approximability of Certain Bicriteria Location Problems. Search on Bibsonomy WG The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
27Mihalis Yannakakis Recent Developments on the Approximability of Combinatorial Problems. Search on Bibsonomy ISAAC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
23C. Thach Nguyen, Nguyen Bao Nguyen, Wing-Kin Sung, Louxin Zhang Reconstructing Recombination Network from Sequence Data: The Small Parsimony Problem. Search on Bibsonomy IEEE ACM Trans. Comput. Biol. Bioinform. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF parsimony method, dynamic programming, approximability, NP-hardness, combination network, phylogenetic network
23Evripidis Bampis, Alexander V. Kononov Bicriteria approximation algorithms for scheduling problems with communications delays. Search on Bibsonomy J. Sched. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF scheduling, approximability, communications delays, multicriteria optimization
23Tapio Elomaa, Matti Kääriäinen The Difficulty of Reduced Error Pruning of Leveled Branching Programs. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF reduced error pruning, approximability, NP-completeness, concept learning, branching programs
23Andrea E. F. Clementi, Paolo Penna, Riccardo Silvestri On the Power Assignment Problem in Radio Networks. Search on Bibsonomy Mob. Networks Appl. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF ad-hoc radio networks, approximability, NP-completeness, energy consumption
23Daniele Micciancio The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant. Search on Bibsonomy FOCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF non-approximability, Sauer's lemma, lattices, shortest vector problem
22Arnab Bhattacharyya 0001, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff Transitive-closure spanners. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
22Chee-Keng Yap Theory of Real Computation According to EGC. Search on Bibsonomy Reliable Implementation of Real Number Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
22Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 Parameterized Complexity of Vertex Cover Variants. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Naveen Garg 0001, Amit Kumar 0001 Minimizing Average Flow-time : Upper and Lower Bounds. Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Hermann Gruber, Markus Holzer 0001 Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. Search on Bibsonomy Developments in Language Theory The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Jaroslaw Byrka An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
22Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke 0002 On the Approximation Hardness of Some Generalizations of TSP. Search on Bibsonomy SWAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
22David P. Woodruff Better Approximations for the Minimum Common Integer Partition Problem. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
22Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001 Parameterized Complexity of Generalized Vertex Cover Problems. Search on Bibsonomy WADS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
22Miroslav Chlebík, Janka Chlebíková On Approximation Hardness of the Minimum 2SAT-DELETION Problem. Search on Bibsonomy MFCS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
22Alberto Caprara Packing 2-Dimensional Bins in Harmony. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
22Christopher Umans On the Complexity and Inapproximability of Shortest Implicant Problems. Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
22Vangelis Th. Paschos A Survey of Approximately Optimal Solutions to Some Covering and Packing Problems. Search on Bibsonomy ACM Comput. Surv. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF approximation algorithms, constrained optimization, combinatorial algorithms, algorithm analysis, problem complexity
22Douglas N. Arnold, Xiaobo Liu Interior estimates for a low order finite element method for the Reissner-Mindlin plate model. Search on Bibsonomy Adv. Comput. Math. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Reissner-Mindlin plate, interior error estimate, 73N10, 65N30, mixed finite element, boundary layer
22Viggo Kann Polynomially Bounded Minimization Problems which are Hard to Approximate. Search on Bibsonomy ICALP The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
16Christian Rieger, Holger Wendland On the Approximability and Curse of Dimensionality of Certain Classes of High-Dimensional Functions. Search on Bibsonomy SIAM J. Numer. Anal. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
16Yann Disser, David Weckbecker Unified Greedy Approximability beyond Submodular Maximization. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
16Chi-Ning Chou, Alexander Golovnev, Madhu Sudan 0001, Santhoshini Velusamy Sketching Approximability of All Finite CSPs. Search on Bibsonomy J. ACM The full citation details ... 2024 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 932 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license