The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1974-1993 (15) 1994-1997 (21) 1998-2000 (17) 2001-2003 (26) 2004 (23) 2005 (30) 2006 (25) 2007 (30) 2008 (38) 2009 (39) 2010 (16) 2011 (18) 2012 (22) 2013 (17) 2014 (22) 2015-2016 (44) 2017 (15) 2018-2019 (37) 2020 (26) 2021 (33) 2022 (16) 2023 (33) 2024 (3)
Publication types (Num. hits)
article(242) incollection(6) inproceedings(318)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 346 occurrences of 204 keywords

Results
Found 566 publication records. Showing 566 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
72Petr Slavík A Tight Analysis of the Greedy Algorithm for Set Cover. Search on Bibsonomy STOC The full citation details ... 1996 DBLP  DOI  BibTeX  RDF fractional set cover, partial set cover, approximation algorithms, greedy algorithm, set cover
72Bonnie Berger, John Rompel, Peter W. Shor Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry Search on Bibsonomy FOCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF unweighted set cover problems, efficient NC algorithms, NC approximation algorithms, weighted set cover problems, set cover algorithm, finite union, finite intersection, finite VC dimension, NC hypothesis finder, linear-processor NC algorithm, computational geometry, learning theory, closure, concept class
69Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. Search on Bibsonomy ICALP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF capacitated covering, Approximation algorithms, linear programming, set cover, vertex cover, randomized rounding
67Rajiv Gandhi, Samir Khuller, Aravind Srinivasan Approximation Algorithms for Partial Covering Problems. Search on Bibsonomy ICALP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering
56Matti Åstrand, Jukka Suomela Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. Search on Bibsonomy SPAA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF edge packing, distributed algorithm, local algorithm, set cover, vertex cover, anonymous network
54Jean Cardinal, Samuel Fiorini, Gwenaël Joret Tight Results on Minimum Entropy Set Cover. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Entropy, Greedy algorithm, Hardness of approximation, Set cover
54Noga Alon, Yossi Azar, Shai Gutner Admission control to minimize rejections and online set cover with repetitions. Search on Bibsonomy SPAA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF admission control, competitive, set cover, on-line
54Tianping Shuai, Xiao-Dong Hu 0001 Connected Set Cover Problem and Its Applications. Search on Bibsonomy AAIM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Approximation algorithm, Set cover, Wavelength assignment, Performance ratio
52Uriel Feige A Threshold of ln n for Approximating Set Cover. Search on Bibsonomy J. ACM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF set cover, approximation ratio
50Yossi Azar, Iftah Gamzu, Xiaoxin Yin Multiple intents re-ranking. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF min-sum set cover, minimum latency set cover, multiple intents, approximation algorithms, ranking
49Reuven Bar-Yehuda One for the Price of Two: A Unified Approach for Approximating Covering Problems. Search on Bibsonomy APPROX The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set
48Kasturi R. Varadarajan Weighted geometric set cover via quasi-uniform sampling. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF approximation, set cover, epsilon nets
45Kamesh Munagala, Shivnath Babu, Rajeev Motwani 0001, Jennifer Widom The Pipelined Set Cover Problem. Search on Bibsonomy ICDT The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Toshihiro Fujito, Tsuyoshi Okumura A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. Search on Bibsonomy ISAAC The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
45Refael Hassin, Asaf Levin An Approximation Algorithm for the Minimum Latency Set Cover Problem. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Minimum sum set cover, minimum latency, approximation algorithm
45Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor The online set cover problem. Search on Bibsonomy STOC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF competitive analysis, on-line algorithms, set-cover, derandomization, randomized rounding
44Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram Universal approximations for TSP, Steiner tree, and set cover. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF sparse partition, approximation algorithms, TSP, Steiner tree, set cover, universal approximation
43Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Approximation algorithms, Combinatorial optimization, Set cover
43Kenneth L. Clarkson, Kasturi R. Varadarajan Improved approximation algorithms for geometric set cover. Search on Bibsonomy SCG The full citation details ... 2005 DBLP  DOI  BibTeX  RDF algorithms, approximation, set cover
42Alexandre H. L. Porto, Valmir Carneiro Barbosa A Methodology for Determining Amino-Acid Substitution Matrices from Set Covers. Search on Bibsonomy EvoWorkshops The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Substitution matrix, Residue set cover, Sequence alignment
41Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled On the set multi-cover problem in geometric settings. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF set cover, cuttings, LP rounding
40Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière Greedy Differential Approximations for Min Set Cover. Search on Bibsonomy SOFSEM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
40Julia Chuzhoy, Joseph Naor Covering Problems with Hard Capacities. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
39Ruoming Jin, Yang Xiang, Lin Liu 0001 Cartesian contour: a concise representation for a collection of frequent sets. Search on Bibsonomy KDD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF concise pattern representation, frequent itemsets, set cover, cartesian product
39Sridhar Rajagopalan, Vijay V. Vazirani Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF randomized voting, primal-dual RNC approximation algorithms, covering integer programs, classical greedy sequential set cover algorithm, parallel approximation algorithms, randomization, set cover problem
39Reuven Bar-Yehuda One for the Price of Two: a Unified Approach for Approximating Covering Problems. Search on Bibsonomy Algorithmica The full citation details ... 2000 DBLP  DOI  BibTeX  RDF Generalized Steiner Forest, Randomized approximations, Approximation algorithm, Set Cover, Vertex Cover, Covering problems, Primal-dual, Local ratio, Feedback Vertex Set
38Gruia Calinescu Bounding the Payment of Approximate Truthful Mechanisms. Search on Bibsonomy ISAAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
35Asaf Levin Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. Search on Bibsonomy WAOA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
35Jean Cardinal, Samuel Fiorini, Gwenaël Joret Tight Results on Minimum Entropy Set Cover. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
34Peng Cui 0008 A Tighter Analysis of Set Cover Greedy Algorithm for Test Set. Search on Bibsonomy ESCAPE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
34Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni Limitations of cross-monotonic cost sharing schemes. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
33Uriel Feige, László Lovász 0001, Prasad Tetali Approximating Min Sum Set Cover. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Threshhold, NP-hardness, Greedy algorithm, Randomized rounding
33Toshihiro Fujito On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF covering integer program, approximation algorithm, combinatorial optimization, partial cover
33Uriel Feige, László Lovász 0001, Prasad Tetali Approximating Min-sum Set Cover. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
33Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani Strategyproof cost-sharing mechanisms for set cover and facility location games. Search on Bibsonomy EC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF mechanism design, facility location, set cover, cost sharing
32Dorit S. Hochbaum, Asaf Levin Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. Search on Bibsonomy WAOA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Approximation algorithms, network design, set cover
31Kasturi R. Varadarajan Epsilon nets and union complexity. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithms, set cover, epsilon nets
31Vangelis Th. Paschos A Theorem on the Approximation of Set Cover and Vertex Cover. Search on Bibsonomy FSTTCS The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
31Erez Buchnik, Shmuel Ur Compacting regression-suites on-the-fly. Search on Bibsonomy APSEC The full citation details ... 1997 DBLP  DOI  BibTeX  RDF regression suite compaction algorithm, regression suite size minimization, online set-cover, intermediate set size, software testing, coverage, program testing, bugs, computational resources, solution quality
30Zhao Zhang 0002, Xiaofeng Gao 0001, Xuefei Zhang, Weili Wu 0001, Hui Xiong 0001 Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System. Search on Bibsonomy DEXA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Fault Tolerance, Set Cover, Sensor Database
30Yuichi Yoshida, Masaki Yamamoto 0001, Hiro Ito An improved constant-time approximation algorithm for maximum matchings. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover
30Xiang-Yang Li 0001, Zheng Sun, Weizhao Wang Cost Sharing and Strategyproof Mechanisms for Set Cover Games. Search on Bibsonomy STACS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
29Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza An IP solution to the art gallery problem. Search on Bibsonomy SCG The full citation details ... 2009 DBLP  DOI  BibTeX  RDF integer programming, visibility, set cover, art gallery
28Min Lu, Tian Liu 0001, Weitian Tong, Guohui Lin, Ke Xu 0001 Set Cover, Set Packing and Hitting Set for Tree Convex and Tree-Like Set Systems. Search on Bibsonomy TAMC The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
27Julien Kritter, Mathieu Brévilliers, Julien Lepagnot, Lhassane Idoumghar On the computational cost of the set cover approach for the optimal camera placement problem and possible set-cover-inspired trade-offs for surveillance infrastructure design. Search on Bibsonomy RAIRO Oper. Res. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
27Rahil Sharma Hard Capacitated Set Cover and Uncapacitated Geometric Set Cover. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
27Apurva Mudgal, Supantha Pandit Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions. Search on Bibsonomy Discret. Appl. Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
27Wei Ren, Qing Zhao A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
27Wei Ren, Qing Zhao A Note on: 'Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem' Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
27Zhao Zhang 0002, Xiaofeng Gao 0001, Weili Wu 0001 Algorithms for connected set cover problem and fault-tolerant connected set cover problem. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
26Francesco Bonchi, Carlos Castillo 0001, Debora Donato, Aristides Gionis Topical query decomposition. Search on Bibsonomy KDD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF query recommendation, clustering, set cover
26Boris Aronov, Esther Ezra, Micha Sharir Small-size epsilon-nets for axis-parallel rectangles and boxes. Search on Bibsonomy STOC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF ?-nets, geometric range spaces, randomized algorithms, set cover, hitting set
26Noga Alon, Dana Moshkovitz, Shmuel Safra Algorithmic construction of sets for k-restrictions. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF k-restriction, almost k-wise independence, generalized hashing, splitter, Set-Cover, Derandomization, group testing
25Refael Hassin, Danny Segev The Set Cover with Pairs Problem. Search on Bibsonomy FSTTCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
25Zheng Sun, Xiang-Yang Li 0001, Weizhao Wang, Xiaowen Chu 0001 Mechanism Design for Set Cover Games When Elements Are Agents. Search on Bibsonomy AAIM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
25Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni Limitations of cross-monotonic cost-sharing schemes. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Cross-monotonic cost-sharing schemes, group-strategyproof mechanism design, probabilistic method
25Paz Carmi, Matthew J. Katz, Nissan Lev-Tov Covering Points by Unit Disks of Fixed Location. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
25Andreas Björklund, Thore Husfeldt Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Exact satisfability, Number of perfect matchings, Set cover, Exact algorithms, Set partition
25K. Selçuk Candan, Huiping Cao, Yan Qi 0002, Maria Luisa Sapino Table summarization with the help of domain lattices. Search on Bibsonomy CIKM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF ranked set cover, table summarization, value clustering lattice
25Stefan Porschen On the Time Complexity of Rectangular Covering Problems in the Discrete Plane. Search on Bibsonomy ICCSA (3) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF rectangular set cover, integer lattice, NP-completeness, discrete plane
24Chengbang Huang, Faruck Morcos, Simon P. Kanaan, Stefan Wuchty, Danny Z. Chen, Jesús A. Izaguirre Predicting Protein-Protein Interactions from Protein Domains Using a Set Cover Approach. Search on Bibsonomy IEEE ACM Trans. Comput. Biol. Bioinform. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF graph algorithms, genetics, biology, bioinformatics (genome or protein) databases, Computations on discrete structures
24Kenneth L. Clarkson, Kasturi R. Varadarajan Improved Approximation Algorithms for Geometric Set Cover. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
24Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. Search on Bibsonomy FCT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23David Peleg Approximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems. Search on Bibsonomy SWAT The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
22Nikhil Bansal 0001, Jatin Batra, Majid Farhadi, Prasad Tetali On Min Sum Vertex Cover and Generalized Min Sum Set Cover. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
22Nikhil Bansal 0001, Jatin Batra, Majid Farhadi, Prasad Tetali Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. Search on Bibsonomy SODA The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
22Karthik C. S., Inbal Livni Navon On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes. Search on Bibsonomy SOSA The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
22Karthik C. S., Inbal Livni Navon On Hardness of Approximation of Parameterized Set Cover and Label Cover: Threshold Graphs from Error Correcting Codes. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
22Nikhil Bansal 0001, Jatin Batra, Majid Farhadi, Prasad Tetali Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
22Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou Set Cover and Vertex Cover with Delay. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
22Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan 0001, Saket Saurabh 0001 Partially Polynomial Kernels for Set Cover and Test Cover. Search on Bibsonomy SIAM J. Discret. Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
22Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan 0001, Saket Saurabh 0001 Partially Polynomial Kernels for Set Cover and Test Cover. Search on Bibsonomy FSTTCS The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
22Barna Saha, Samir Khuller Set Cover Revisited: Hypergraph Cover with Hard Capacities. Search on Bibsonomy ICALP (1) The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
22Dorit S. Hochbaum, Asaf Levin The multi-integer set cover and the facility terminal cover problem. Search on Bibsonomy Networks The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
22Petr Slavík Improved Performance of the Greedy Algorithm for the Minimum Set Cover and Minimum Partial Cover Problems Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 1995 DBLP  BibTeX  RDF
21Michael Dom, Daniel Lokshtanov, Saket Saurabh 0001 Incompressibility through Colors and IDs. Search on Bibsonomy ICALP (1) The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
20Liang Chen, Jason Crampton Set Covering Problems in Role-Based Access Control. Search on Bibsonomy ESORICS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
20Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher A Derandomization Using Min-Wise Independent Permutations. Search on Bibsonomy RANDOM The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
20Satoru Iwata 0001, Kiyohito Nagano Submodular Function Minimization under Covering Constraints. Search on Bibsonomy FOCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF approximation algorithm, set cover, vertex cover, submodular function
20Fedor V. Fomin, Fabrizio Grandoni 0001, Artem V. Pyatkin, Alexey A. Stepanov Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Exact exponential algorithms, domatic number, listing algorithms, measure and conquer, minimum dominating set, minimum set cover
20Venkatesh Raman 0001, Saket Saurabh 0001 Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity
20Meng-Chiou Wu, Rung-Bin Lin, Shih-Cheng Tsai Chip placement in a reticle for multiple-project wafer fabrication. Search on Bibsonomy ACM Trans. Design Autom. Electr. Syst. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Multiple-project wafers (MPW), compatibility graph, reticle floorplanning, shuttle mask, wafer dicing, simulated annealing (SA), set cover, mixed-integer linear programming (MILP), conflict graph, set partition
20Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. Search on Bibsonomy KDD The full citation details ... 2008 DBLP  DOI  BibTeX  RDF hyperrectangle, summarization, set cover, transactional databases
20Doina Logofatu, Rolf Drechsler Comparative Study by Solving the Test Compaction Problem. Search on Bibsonomy ISMVL The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Backtracking, Multi-Valued Logic, Test Compaction, Set Cover Problem, Greedy, Don't Cares
20Alberto Aloisio, Vincenzo Izzo, Salvatore Rampone VLSI implementation of greedy-based distributed routing schemes for ad hoc networks. Search on Bibsonomy Soft Comput. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Greedy algorithm, Ad hoc wireless network, FPGA implementation, Minimum set cover
20Anirban Dasgupta 0001, Arpita Ghosh, Ravi Kumar 0001, Christopher Olston, Sandeep Pandey, Andrew Tomkins The discoverability of the web. Search on Bibsonomy WWW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF max cover, discovery, set cover, crawling, greedy
20Matthias F. M. Stallmann, Franc Brglez High-contrast algorithm behavior: observation, hypothesis, and experimental design. Search on Bibsonomy Experimental Computer Science The full citation details ... 2007 DBLP  DOI  BibTeX  RDF all-integer dual simplex, block-diagonal form, optimization, set cover, crossing minimization
20David S. Johnson The NP-completeness column: The many limits on approximation. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2006 DBLP  DOI  BibTeX  RDF label cover, Approximation algorithms, lower bounds, set cover, clique, probabilistically checkable proofs, Unique Games Conjecture
20Yigal Bejerano, Rajeev Rastogi Robust monitoring of link delays and faults in IP networks. Search on Bibsonomy IEEE/ACM Trans. Netw. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF latency and fault monitoring, approximation algorithms, set cover problem, network failures
20Torsten Fahle, Karsten Tiemann A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. Search on Bibsonomy ACM J. Exp. Algorithmics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF test-cover problem, variable fixing, Branch-and-bound, Lagrangian relaxation, set-cover problem
20Özgür Sümer Partial covering of hypergraphs. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF partial hypergraph cover, partial set cover, greedy algorithm
20Adam Cannon, Lenore Cowen Approximation Algorithms for the Class Cover Problem. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF disk cover, margin classifier, classification, approximation algorithms, set cover
20Alon Efrat, Frank Hoffmann 0002, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk Covering with Ellipses. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Approximation algorithm, Computational geometry, Set cover, Proteomics, Algorithms and data structures
20Reuven Bar-Yehuda Using Homogenous Weights for Approximating the Partial Cover Problem. Search on Bibsonomy SODA The full citation details ... 1999 DBLP  BibTeX  RDF approximation algorithm, set cover, vertex cover, knapsack, covering problems, local ratio, partial covering
20Moni Naor, Leonard J. Schulman, Aravind Srinivasan Splitters and Near-Optimal Derandomization. Search on Bibsonomy FOCS The full citation details ... 1995 DBLP  DOI  BibTeX  RDF splitters, near-optimal derandomization, fairly general method, k-restrictions, probabilistic bound, near-optimal constructions, fixed-subgraph finding algorithms, deterministic constructions, local-coloring protocol, computational complexity, learning, probability, computational linguistics, hardness of approximation, set cover, derandomization, randomised algorithms, exhaustive testing
20Carsten Lund, Mihalis Yannakakis On the Hardness of Approximating Minimization Problems. Search on Bibsonomy J. ACM The full citation details ... 1994 DBLP  DOI  BibTeX  RDF clique cover, approximation algorithms, NP-hard, graph coloring, dominating set, set cover, independent set, chromatic number, probabilistically checkable proofs, hitting set
20Aditi Dhagat, Lisa Hellerstein PAC Learning with Irrelevant Attributes Search on Bibsonomy FOCS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF polynomial-time Occam algorithm, irrelevant attributes, Occam algorithm, decision lists, greedy set cover, polynomial-time, PAC learning
20Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF approximate optima, NP-hard, lattices, codes, polynomial time algorithm, linear equations, interactive proof systems, hardness, set-cover problem, binary codes
20Richard Chang 0001, William I. Gasarch On Bounded Queries and Approximation Search on Bibsonomy FOCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF NP-optimization problems, NP oracle, maximum clique size, computational complexity, approximation, graph coloring, set cover, complexity measure, approximation factor, bounded queries
20Vassilis Zissimopoulos, Vangelis Th. Paschos, Ferhan Pekergin On the Approximation of NP-Complete Problems by Using the Boltzmann Machine Method: The Cases of Some Covering and Packing Problems. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1991 DBLP  DOI  BibTeX  RDF Boltzmann machine method, minimum vertex cover, computational complexity, parallel architectures, approximation, neural nets, NP-complete problems, heuristic programming, covering, clique, combinatorial mathematics, optimal solutions, maximum independent set, set partitioning, packing problems, minimum set cover
Displaying result #1 - #100 of 566 (100 per page; Change: )
Pages: [1][2][3][4][5][6][>>]
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