|
|
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 |
72 | Petr Slavík |
A Tight Analysis of the Greedy Algorithm for Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996, pp. 435-441, 1996, ACM, 0-89791-785-5. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
fractional set cover, partial set cover, approximation algorithms, greedy algorithm, set cover |
72 | Bonnie Berger, John Rompel, Peter W. Shor |
Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 54-59, 1989, IEEE Computer Society, 0-8186-1982-1. The full citation details ...](Pics/full.jpeg) |
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 |
69 | Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan |
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, pp. 164-175, 2003, Springer, 3-540-40493-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
capacitated covering, Approximation algorithms, linear programming, set cover, vertex cover, randomized rounding |
67 | Rajiv Gandhi, Samir Khuller, Aravind Srinivasan |
Approximation Algorithms for Partial Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 225-236, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Approximation algorithms, set cover, vertex cover, randomized rounding, primal-dual methods, partial covering |
56 | Matti Åstrand, Jukka Suomela |
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, Thira, Santorini, Greece, June 13-15, 2010, pp. 294-302, 2010, ACM, 978-1-4503-0079-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
edge packing, distributed algorithm, local algorithm, set cover, vertex cover, anonymous network |
54 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Tight Results on Minimum Entropy Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 51(1), pp. 49-60, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Entropy, Greedy algorithm, Hardness of approximation, Set cover |
54 | Noga Alon, Yossi Azar, Shai Gutner |
Admission control to minimize rejections and online set cover with repetitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada, USA, pp. 238-244, 2005, ACM, 1-58113-986-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
admission control, competitive, set cover, on-line |
54 | Tianping Shuai, Xiao-Dong Hu 0001 |
Connected Set Cover Problem and Its Applications. ![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. 243-254, 2006, Springer, 3-540-35157-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Set cover, Wavelength assignment, Performance ratio |
52 | Uriel Feige |
A Threshold of ln n for Approximating Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 45(4), pp. 634-652, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
set cover, approximation ratio |
50 | Yossi Azar, Iftah Gamzu, Xiaoxin Yin |
Multiple intents re-ranking. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 669-678, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
min-sum set cover, minimum latency set cover, multiple intents, approximation algorithms, ranking |
49 | Reuven Bar-Yehuda |
One for the Price of Two: A Unified Approach for Approximating Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, pp. 49-62, 1998, Springer, 3-540-64736-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Generalized Steiner Forest, Randomized Approximations, Approximation Algorithm, Set Cover, Vertex Cover, Covering Problems, Local Ratio, Feedback Vertex Set |
48 | Kasturi R. Varadarajan |
Weighted geometric set cover via quasi-uniform sampling. ![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. 641-648, 2010, ACM, 978-1-4503-0050-6. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
approximation, set cover, epsilon nets |
45 | Kamesh Munagala, Shivnath Babu, Rajeev Motwani 0001, Jennifer Widom |
The Pipelined Set Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2005, 10th International Conference, Edinburgh, UK, January 5-7, 2005, Proceedings, pp. 83-98, 2005, Springer, 3-540-24288-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
45 | Toshihiro Fujito, Tsuyoshi Okumura |
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings, pp. 670-681, 2001, Springer, 3-540-42985-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
45 | Refael Hassin, Asaf Levin |
An Approximation Algorithm for the Minimum Latency Set Cover Problem. ![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. 726-733, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Minimum sum set cover, minimum latency, approximation algorithm |
45 | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |
The online set cover problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 100-105, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
competitive analysis, on-line algorithms, set-cover, derandomization, randomized rounding |
44 | Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram |
Universal approximations for TSP, Steiner tree, and set cover. ![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. 386-395, 2005, ACM, 1-58113-960-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
sparse partition, approximation algorithms, TSP, Steiner tree, set cover, universal approximation |
43 | Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis |
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 45(3), pp. 555-576, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Combinatorial optimization, Set cover |
43 | Kenneth L. Clarkson, Kasturi R. Varadarajan |
Improved approximation algorithms for geometric set cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 21st ACM Symposium on Computational Geometry, Pisa, Italy, June 6-8, 2005, pp. 135-141, 2005, ACM, 1-58113-991-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
algorithms, approximation, set cover |
42 | Alexandre H. L. Porto, Valmir Carneiro Barbosa |
A Methodology for Determining Amino-Acid Substitution Matrices from Set Covers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoWorkshops ![In: Applications of Evolutionary Computing, EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC, Budapest, Hungary, April 10-12, 2006, Proceedings, pp. 138-148, 2006, Springer, 3-540-33237-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Substitution matrix, Residue set cover, Sequence alignment |
41 | Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled |
On the set multi-cover problem in geometric settings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 341-350, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
set cover, cuttings, LP rounding |
40 | Cristina Bazgan, Jérôme Monnot, Vangelis Th. Paschos, Fabrice Serrière |
Greedy Differential Approximations for Min Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2005: Theory and Practice of Computer Science, 31st Conference on Current Trends in Theory and Practice of Computer Science, Liptovský Ján, Slovakia, January 22-28, 2005, Proceedings, pp. 62-71, 2005, Springer, 3-540-24302-X. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
40 | Julia Chuzhoy, Joseph Naor |
Covering Problems with Hard Capacities. ![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. 481-489, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
39 | Ruoming Jin, Yang Xiang, Lin Liu 0001 |
Cartesian contour: a concise representation for a collection of frequent sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, June 28 - July 1, 2009, pp. 417-426, 2009, ACM, 978-1-60558-495-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
concise pattern representation, frequent itemsets, set cover, cartesian product |
39 | Sridhar Rajagopalan, Vijay V. Vazirani |
Primal-dual RNC approximation algorithms for (multi)-set (multi)-cover and covering integer programs ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 322-331, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
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 |
39 | Reuven Bar-Yehuda |
One for the Price of Two: a Unified Approach for Approximating Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 27(2), pp. 131-144, 2000. The full citation details ...](Pics/full.jpeg) |
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 |
38 | Gruia Calinescu |
Bounding the Payment of Approximate Truthful Mechanisms. ![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. 221-233, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Asaf Levin |
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 4th International Workshop, WAOA 2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers, pp. 290-301, 2006, Springer, 3-540-69513-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
35 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Tight Results on Minimum Entropy Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings, pp. 61-69, 2006, Springer, 3-540-38044-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
34 | Peng Cui 0008 |
A Tighter Analysis of Set Cover Greedy Algorithm for Test Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESCAPE ![In: Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, First International Symposium, ESCAPE 2007, Hangzhou, China, April 7-9, 2007, Revised Selected Papers, pp. 24-35, 2007, Springer, 978-3-540-74449-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
34 | Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni |
Limitations of cross-monotonic cost sharing schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 602-611, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
33 | Uriel Feige, László Lovász 0001, Prasad Tetali |
Approximating Min Sum Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 40(4), pp. 219-234, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Threshhold, NP-hardness, Greedy algorithm, Randomized rounding |
33 | Toshihiro Fujito |
On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 8(4), pp. 439-452, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
covering integer program, approximation algorithm, combinatorial optimization, partial cover |
33 | Uriel Feige, László Lovász 0001, Prasad Tetali |
Approximating Min-sum Set Cover. ![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. 94-107, 2002, Springer, 3-540-44186-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Nikhil R. Devanur, Milena Mihail, Vijay V. Vazirani |
Strategyproof cost-sharing mechanisms for set cover and facility location games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), San Diego, California, USA, June 9-12, 2003, pp. 108-114, 2003, ACM, 1-58113-679-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
mechanism design, facility location, set cover, cost sharing |
32 | Dorit S. Hochbaum, Asaf Levin |
Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers, pp. 116-127, 2007, Springer, 978-3-540-77917-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithms, network design, set cover |
31 | Kasturi R. Varadarajan |
Epsilon nets and union complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 11-16, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, set cover, epsilon nets |
31 | Vangelis Th. Paschos |
A Theorem on the Approximation of Set Cover and Vertex Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 11th Conference, New Delhi, India, December 17-19, 1991, Proceedings, pp. 278-287, 1991, Springer, 3-540-54967-6. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
31 | Erez Buchnik, Shmuel Ur |
Compacting regression-suites on-the-fly. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 4th Asia-Pacific Software Engineering and International Computer Science Conference (APSEC '97 / ICSC '97), 2-5 December 1997, Clear Water Bay, Hong Kong, pp. 385-394, 1997, IEEE Computer Society, 0-8186-8271-X. The full citation details ...](Pics/full.jpeg) |
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 |
30 | Zhao 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](Pics/bibsonomy.png) |
DEXA ![In: Database and Expert Systems Applications, 20th International Conference, DEXA 2009, Linz, Austria, August 31 - September 4, 2009. Proceedings, pp. 807-821, 2009, Springer, 978-3-642-03572-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Fault Tolerance, Set Cover, Sensor Database |
30 | Yuichi Yoshida, Masaki Yamamoto 0001, Hiro Ito |
An improved constant-time approximation algorithm for maximum matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 225-234, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover |
30 | Xiang-Yang Li 0001, Zheng Sun, Weizhao Wang |
Cost Sharing and Strategyproof Mechanisms for Set Cover Games. ![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. 218-230, 2005, Springer, 3-540-24998-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza |
An IP solution to the art gallery problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 88-89, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
integer programming, visibility, set cover, art gallery |
28 | Min 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](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings, pp. 248-258, 2014, Springer, 978-3-319-06088-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
27 | Julien 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](Pics/bibsonomy.png) |
RAIRO Oper. Res. ![In: RAIRO Oper. Res. 55(4), pp. 2069-2091, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
27 | Rahil Sharma |
Hard Capacitated Set Cover and Uncapacitated Geometric Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1612.03097, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
27 | Apurva Mudgal, Supantha Pandit |
Geometric hitting set, set cover and generalized class cover problems with half-strips in opposite directions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 211, pp. 143-162, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
27 | Wei Ren, Qing Zhao |
A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 412(45), pp. 6451-6454, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
27 | Wei Ren, Qing Zhao |
A Note on: 'Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem' ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1104.0733, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
27 | Zhao Zhang 0002, Xiaofeng Gao 0001, Weili Wu 0001 |
Algorithms for connected set cover problem and fault-tolerant connected set cover problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 410(8-10), pp. 812-817, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
26 | Francesco Bonchi, Carlos Castillo 0001, Debora Donato, Aristides Gionis |
Topical query decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008, pp. 52-60, 2008, ACM, 978-1-60558-193-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
query recommendation, clustering, set cover |
26 | Boris Aronov, Esther Ezra, Micha Sharir |
Small-size epsilon-nets for axis-parallel rectangles and boxes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 639-648, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
?-nets, geometric range spaces, randomized algorithms, set cover, hitting set |
26 | Noga Alon, Dana Moshkovitz, Shmuel Safra |
Algorithmic construction of sets for k-restrictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(2), pp. 153-177, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
k-restriction, almost k-wise independence, generalized hashing, splitter, Set-Cover, Derandomization, group testing |
25 | Refael Hassin, Danny Segev |
The Set Cover with Pairs Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 25th International Conference, Hyderabad, India, December 15-18, 2005, Proceedings, pp. 164-176, 2005, Springer, 3-540-30495-9. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Zheng Sun, Xiang-Yang Li 0001, Weizhao Wang, Xiaowen Chu 0001 |
Mechanism Design for Set Cover Games When Elements Are Agents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings, pp. 360-369, 2005, Springer, 3-540-26224-5. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
25 | Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirrokni |
Limitations of cross-monotonic cost-sharing schemes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(2), pp. 24:1-24:25, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Cross-monotonic cost-sharing schemes, group-strategyproof mechanism design, probabilistic method |
25 | Paz Carmi, Matthew J. Katz, Nissan Lev-Tov |
Covering Points by Unit Disks of Fixed Location. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 644-655, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
25 | Andreas Björklund, Thore Husfeldt |
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(2), pp. 226-249, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Exact satisfability, Number of perfect matchings, Set cover, Exact algorithms, Set partition |
25 | K. Selçuk Candan, Huiping Cao, Yan Qi 0002, Maria Luisa Sapino |
Table summarization with the help of domain lattices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIKM ![In: Proceedings of the 17th ACM Conference on Information and Knowledge Management, CIKM 2008, Napa Valley, California, USA, October 26-30, 2008, pp. 1473-1474, 2008, ACM, 978-1-59593-991-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
ranked set cover, table summarization, value clustering lattice |
25 | Stefan Porschen |
On the Time Complexity of Rectangular Covering Problems in the Discrete Plane. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCSA (3) ![In: Computational Science and Its Applications - ICCSA 2004, International Conference, Assisi, Italy, May 14-17, 2004, Proceedings, Part III, pp. 137-146, 2004, Springer, 3-540-22057-7. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
rectangular set cover, integer lattice, NP-completeness, discrete plane |
24 | Chengbang 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](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 4(1), pp. 78-87, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
graph algorithms, genetics, biology, bioinformatics (genome or protein) databases, Computations on discrete structures |
24 | Kenneth L. Clarkson, Kasturi R. Varadarajan |
Improved Approximation Algorithms for Geometric Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 37(1), pp. 43-58, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis |
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 16th International Symposium, FCT 2007, Budapest, Hungary, August 27-30, 2007, Proceedings, pp. 52-63, 2007, Springer, 978-3-540-74239-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
23 | David Peleg |
Approximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings, pp. 220-230, 2000, Springer, 3-540-67690-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
22 | Nikhil Bansal 0001, Jatin Batra, Majid Farhadi, Prasad Tetali |
On Min Sum Vertex Cover and Generalized Min Sum Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 52(2), pp. 327-357, April 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
22 | Nikhil Bansal 0001, Jatin Batra, Majid Farhadi, Prasad Tetali |
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, pp. 998-1005, 2021, SIAM, 978-1-61197-646-5. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Karthik 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](Pics/bibsonomy.png) |
SOSA ![In: 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11-12, 2021, pp. 210-223, 2021, SIAM, 978-1-61197-649-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
22 | Karthik 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](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.02778, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
22 | Nikhil Bansal 0001, Jatin Batra, Majid Farhadi, Prasad Tetali |
Improved Approximations for Min Sum Vertex Cover and Generalized Min Sum Set Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2007.09172, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
22 | Yossi Azar, Ashish Chiplunkar, Shay Kutten, Noam Touitou |
Set Cover and Vertex Cover with Delay. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.08543, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
22 | Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan 0001, Saket Saurabh 0001 |
Partially Polynomial Kernels for Set Cover and Test Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 30(3), pp. 1401-1423, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
22 | Manu Basavaraju, Mathew C. Francis, M. S. Ramanujan 0001, Saket Saurabh 0001 |
Partially Polynomial Kernels for Set Cover and Test Cover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India, pp. 67-78, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-64-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Barna Saha, Samir Khuller |
Set Cover Revisited: Hypergraph Cover with Hard Capacities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I, pp. 762-773, 2012, Springer, 978-3-642-31593-0. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
22 | Dorit S. Hochbaum, Asaf Levin |
The multi-integer set cover and the facility terminal cover problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 53(1), pp. 63-66, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
22 | Petr Slavík |
Improved Performance of the Greedy Algorithm for the Minimum Set Cover and Minimum Partial Cover Problems ![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 |
|
21 | Michael Dom, Daniel Lokshtanov, Saket Saurabh 0001 |
Incompressibility through Colors and IDs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I, pp. 378-389, 2009, Springer, 978-3-642-02926-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Liang Chen, Jason Crampton |
Set Covering Problems in Role-Based Access Control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESORICS ![In: Computer Security - ESORICS 2009, 14th European Symposium on Research in Computer Security, Saint-Malo, France, September 21-23, 2009. Proceedings, pp. 689-704, 2009, Springer, 978-3-642-04443-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
20 | Andrei Z. Broder, Moses Charikar, Michael Mitzenmacher |
A Derandomization Using Min-Wise Independent Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RANDOM ![In: Randomization and Approximation Techniques in Computer Science, Second International Workshop, RANDOM'98, Barcelona, Spain, October 8-10, 1998, Proceedings, pp. 15-24, 1998, Springer, 3-540-65142-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
20 | Satoru Iwata 0001, Kiyohito Nagano |
Submodular Function Minimization under Covering Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 50th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2009, October 25-27, 2009, Atlanta, Georgia, USA, pp. 671-680, 2009, IEEE Computer Society, 978-0-7695-3850-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithm, set cover, vertex cover, submodular function |
20 | Fedor 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](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 5(1), pp. 9:1-9:17, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Exact exponential algorithms, domatic number, listing algorithms, measure and conquer, minimum dominating set, minimum set cover |
20 | Venkatesh 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](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 52(2), pp. 203-225, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity |
20 | Meng-Chiou Wu, Rung-Bin Lin, Shih-Cheng Tsai |
Chip placement in a reticle for multiple-project wafer fabrication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Design Autom. Electr. Syst. ![In: ACM Trans. Design Autom. Electr. Syst. 13(1), pp. 22:1-22:21, 2008. The full citation details ...](Pics/full.jpeg) |
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 |
20 | Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan |
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008, pp. 758-766, 2008, ACM, 978-1-60558-193-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hyperrectangle, summarization, set cover, transactional databases |
20 | Doina Logofatu, Rolf Drechsler |
Comparative Study by Solving the Test Compaction Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 38th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2008), 22-23 May 2008, Dallas, Texas, USA, pp. 44-49, 2008, IEEE Computer Society, 978-0-7695-3155-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Backtracking, Multi-Valued Logic, Test Compaction, Set Cover Problem, Greedy, Don't Cares |
20 | Alberto Aloisio, Vincenzo Izzo, Salvatore Rampone |
VLSI implementation of greedy-based distributed routing schemes for ad hoc networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 11(9), pp. 865-872, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Greedy algorithm, Ad hoc wireless network, FPGA implementation, Minimum set cover |
20 | Anirban Dasgupta 0001, Arpita Ghosh, Ravi Kumar 0001, Christopher Olston, Sandeep Pandey, Andrew Tomkins |
The discoverability of the web. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WWW ![In: Proceedings of the 16th International Conference on World Wide Web, WWW 2007, Banff, Alberta, Canada, May 8-12, 2007, pp. 421-430, 2007, ACM, 978-1-59593-654-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
max cover, discovery, set cover, crawling, greedy |
20 | Matthias F. M. Stallmann, Franc Brglez |
High-contrast algorithm behavior: observation, hypothesis, and experimental design. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Experimental Computer Science ![In: Proceedings of the Workshop on Experimental Computer Science, Part of ACM FCRC, San Diego, CA, USA, 13-14 June 2007, pp. 12, 2007, ACM, 978-1-59593-751-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
all-integer dual simplex, block-diagonal form, optimization, set cover, crossing minimization |
20 | David S. Johnson |
The NP-completeness column: The many limits on approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(3), pp. 473-489, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
label cover, Approximation algorithms, lower bounds, set cover, clique, probabilistically checkable proofs, Unique Games Conjecture |
20 | Yigal Bejerano, Rajeev Rastogi |
Robust monitoring of link delays and faults in IP networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 14(5), pp. 1092-1103, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
latency and fault monitoring, approximation algorithms, set cover problem, network failures |
20 | Torsten Fahle, Karsten Tiemann |
A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 11, 2006. The full citation details ...](Pics/full.jpeg) |
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](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 572-581, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
partial hypergraph cover, partial set cover, greedy algorithm |
20 | Adam Cannon, Lenore Cowen |
Approximation Algorithms for the Class Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 40(3-4), pp. 215-224, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
disk cover, margin classifier, classification, approximation algorithms, set cover |
20 | Alon Efrat, Frank Hoffmann 0002, Christian Knauer, Klaus Kriegel, Günter Rote, Carola Wenk |
Covering with Ellipses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 38(1), pp. 145-160, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Computational geometry, Set cover, Proteomics, Algorithms and data structures |
20 | Reuven Bar-Yehuda |
Using Homogenous Weights for Approximating the Partial Cover Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 17-19 January 1999, Baltimore, Maryland, USA., pp. 71-75, 1999, ACM/SIAM, 0-89871-434-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP BibTeX RDF |
approximation algorithm, set cover, vertex cover, knapsack, covering problems, local ratio, partial covering |
20 | Moni Naor, Leonard J. Schulman, Aravind Srinivasan |
Splitters and Near-Optimal Derandomization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 182-191, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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 |
20 | Carsten Lund, Mihalis Yannakakis |
On the Hardness of Approximating Minimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 41(5), pp. 960-981, 1994. The full citation details ...](Pics/full.jpeg) |
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 |
20 | Aditi Dhagat, Lisa Hellerstein |
PAC Learning with Irrelevant Attributes ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 64-74, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
polynomial-time Occam algorithm, irrelevant attributes, Occam algorithm, decision lists, greedy set cover, polynomial-time, PAC learning |
20 | Sanjeev Arora, László Babai, Jacques Stern, Z. Sweedyk |
The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 724-733, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
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 |
20 | Richard Chang 0001, William I. Gasarch |
On Bounded Queries and Approximation ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 547-556, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
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 |
20 | Vassilis 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](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(12), pp. 1413-1418, 1991. The full citation details ...](Pics/full.jpeg) |
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][ >>] |
|