The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase APX-Hardness (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1999-2006 (19) 2007-2017 (15) 2020-2023 (5)
Publication types (Num. hits)
article(10) inproceedings(29)
Venues (Conferences, Journals, ...)
ISAAC(5) CoRR(4) ESA(3) FOCS(3) Inf. Process. Lett.(2) SODA(2) STOC(2) WALCOM(2) WG(2) ACM Trans. Algorithms(1) Algorithmica(1) APPROX-RANDOM(1) CCCG(1) CIAC(1) Comput. Geom.(1) FSTTCS(1) More (+10 of total 23)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 42 occurrences of 28 keywords

Results
Found 39 publication records. Showing 39 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
129Sounaka Mishra, Kripasindhu Sikdar On the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem. Search on Bibsonomy IFIP TCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF NP-optimization problems, Minimaximal and maximinimal NP-optimization problems, L-reduction, Approximation algorithms, Hardness of approximation, APX-hardness
107Sascha 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
82Bernhard Fuchs On the Hardness of Range Assignment Problems. Search on Bibsonomy CIAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
56Julia Chuzhoy, Sanjeev Khanna Hardness of cut problems in directed graphs. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF directed multicut, hardness of approximation, sparsest cut
48Miroslav Chlebík, Janka Chlebíková Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
42Joseph Cheriyan, Mohammad R. Salavatipour Hardness and Approximation Results for Packing Steiner Trees. Search on Bibsonomy Algorithmica The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Approximation algorithms, Steiner trees, Hardness of approximation, Packing problems
42Joseph Cheriyan, Mohammad R. Salavatipour Hardness and Approximation Results for Packing Steiner Trees. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
41Sébastien Angibaud, Guillaume Fertin, Irena Rusu On the Approximability of Comparing Genomes with Duplicates. Search on Bibsonomy WALCOM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF conserved intervals, genome rearrangement, duplicates, breakpoints, adjacencies, common intervals, APX-Hardness
41Omid Amini, Stéphane Pérennes, Ignasi Sau Hardness and Approximation of Traffic Grooming. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF SONET ADM, Approximation Algorithms, Optical Networks, PTAS, inapproximability, Traffic Grooming, APX-hardness
40Basile Couëtoux, Laurent Gourvès, Jérôme Monnot, Orestis Telelis On Labeled Traveling Salesman Problems. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
40Moses Charikar, Venkatesan Guruswami, Anthony Wirth Clustering with Qualitative Information. Search on Bibsonomy FOCS The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
39Jingyang Zhao 0001, Mingyu Xiao 0001 The APX-hardness of the Traveling Tournament Problem. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
39Debajyoti Mondal, Angelin Jemima Rajasingh, N. Parthiban, Indra Rajasingh APX-hardness and approximation for the k-burning number problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
39Mayank Chaturvedi, Bengt J. Nilsson APX-Hardness of the Minimum Vision Points Problem. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
39Debajyoti Mondal, N. Parthiban, V. Kavitha 0003, Indra Rajasingh APX-Hardness and Approximation for the k-Burning Number Problem. Search on Bibsonomy WALCOM The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
39Debajyoti Mondal, N. Parthiban, V. Kavitha 0003, Indra Rajasingh APX-Hardness and Approximation for the k-Burning Number Problem. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
39Euiwoong Lee APX-hardness of maximizing Nash social welfare with indivisible items. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
39Euiwoong Lee APX-Hardness of Maximizing Nash Social Welfare with Indivisible Items. Search on Bibsonomy CoRR The full citation details ... 2015 DBLP  BibTeX  RDF
39Timothy M. Chan, Elyot Grant Exact algorithms and APX-hardness results for geometric packing and covering problems. Search on Bibsonomy Comput. Geom. The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
39Nabil H. Mustafa, Rajiv Raman 0001, Saurabh Ray Settling the APX-Hardness Status for Geometric Set Cover. Search on Bibsonomy FOCS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
39Elyot Grant, Timothy M. Chan Exact Algorithms and APX-Hardness Results for Geometric Set Cover. Search on Bibsonomy CCCG The full citation details ... 2011 DBLP  BibTeX  RDF
39Mirela Damian, Sriram V. Pemmaraju APX-hardness of domination problems in circle graphs. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
33Rohit Khandekar, Tracy Kimbrel, Konstantin Makarychev, Maxim Sviridenko On Hardness of Pricing Items for Single-Minded Bidders. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
33Nikhil Bansal 0001, Amit Chakrabarti, Amir Epstein, Baruch Schieber A quasi-PTAS for unsplittable flow on line graphs. Search on Bibsonomy STOC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF scheduling, approximation algorithms, resource allocation, approximation scheme, unsplittable flow
33Hans-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 FSTTCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF minimum-cost biconnected spanning subgraph, Approximation algorithm, inapproximability, augmentation
27Patrick Briest, Piotr Krysta Single-minded unlimited supply pricing on sparse instances. Search on Bibsonomy SODA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Uriel Feige, Jan Vondrák Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. Search on Bibsonomy FOCS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
27Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz How to Sell a Graph: Guidelines for Graph Retailers. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Pricing problems, tollbooth problem, highway problem, computational complexity, dynamic programming, fully polynomial time approximation scheme
20Cristina Bazgan, Basile Couëtoux, Zsolt Tuza Covering a Graph with a Constrained Forest (Extended Abstract). Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
20Piotr Berman, Bhaskar DasGupta, Marek Karpinski Approximating Transitive Reductions for Directed Networks. Search on Bibsonomy WADS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
20Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour Two-Stage Robust Network Design with Exponential Scenarios. Search on Bibsonomy ESA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
20Thomas Erlebach, Erik Jan van Leeuwen Domination in Geometric Intersection Graphs. Search on Bibsonomy LATIN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
20Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster Approximation algorithms and hardness results for cycle packing problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Cycle packing, edge-disjoint, approximation algorithms, hardness of approximation, integrality gap
20Toshimasa Ishii Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
20Venkatesan Guruswami On 2-Query Codeword Testing with Near-Perfect Completeness. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
20Ralf Klasing, Euripides Markou, Tomasz Radzik, Fabiano Sarracco Approximation Bounds for Black Hole Search Problems. Search on Bibsonomy OPODIS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF black hole search, approximation algorithm, mobile agent, inapproximability, graph exploration
20Dirk Bongartz Some Notes on the Complexity of Protein Similarity Search under mRNA Structure Constraints. Search on Bibsonomy SOFSEM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
20Yossi Azar, Leah Epstein, Yossi Richter, Gerhard J. Woeginger All-Norm Approximation Algorithms. Search on Bibsonomy SWAT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
20Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi 0001 On the Approximability of the Minimum Test Collection Problem. Search on Bibsonomy ESA The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #39 of 39 (100 per page; Change: )
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