| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Tianping Shuai, Xiao-Dong Hu |
Connected Set Cover Problem and Its Applications.  |
AAIM  |
2006 |
DBLP DOI BibTeX RDF |
Approximation algorithm, Set cover, Wavelength assignment, Performance ratio |
| 2 | Asaf Levin |
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Refael Hassin, Asaf Levin |
An Approximation Algorithm for the Minimum Latency Set Cover Problem. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
Minimum sum set cover, minimum latency, approximation algorithm |
| 2 | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |
The online set cover problem. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
competitive analysis, on-line algorithms, set-cover, derandomization, randomized rounding |
| 2 | Toshihiro Fujito, Tsuyoshi Okumura |
A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. |
ISAAC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen, V. N. Muralidhara |
The covert set-cover problem with application to Network Discovery |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni |
Approximation algorithms for a geometric set cover problem. |
Discrete Applied Mathematics |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Skutella, David P. Williamson |
A note on the generalized min-sum set cover problem. |
Oper. Res. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin E. Brimkov, Andrew Leach, Jimmy Wu, Michael Mastroianni |
On the Approximability of a Geometric Set Cover Problem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Wei Ren, Qing Zhao |
A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problem'. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Fürer, Huiwen Yu |
Packing-Based Approximation Algorithm for the k-Set Cover Problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Wei Ren, Qing Zhao |
A Note on: `Algorithms for Connected Set Cover Problem and Fault-Tolerant Connected Set Cover Problem' |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Martin Skutella, David P. Williamson |
A note on the generalized min-sum set cover problem |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Martin Fürer, Huiwen Yu |
Packing-Based Approximation Algorithm for the k-Set Cover Problem. |
ISAAC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandeep Sen, V. N. Muralidhara |
The Covert Set-Cover Problem with Application to Network Discovery. |
WALCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kasturi Varadarajan |
Weighted geometric set cover via quasi-uniform sampling. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
approximation, set cover, epsilon nets |
| 1 | Zhao Zhang, Xiaofeng Gao, Weili Wu |
Algorithms for connected set cover problem and fault-tolerant connected set cover problem. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |
The Online Set Cover Problem. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nan Tang, Lefteris Sidirourgos, Peter A. Boncz |
Space-economical partial gram indices for exact substring matching. |
CIKM |
2009 |
DBLP DOI BibTeX RDF |
Q-gram string matching |
| 1 | Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled |
On the set multi-cover problem in geometric settings. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
set cover, cuttings, LP rounding |
| 1 | Marcelo C. Couto, Pedro Jussieu de Rezende, Cid C. de Souza |
An IP solution to the art gallery problem. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
integer programming, visibility, set cover, art gallery |
| 1 | Kasturi R. Varadarajan |
Epsilon nets and union complexity. |
Symposium on Computational Geometry |
2009 |
DBLP DOI BibTeX RDF |
approximation algorithms, set cover, epsilon nets |
| 1 | Ruoming Jin, Yang Xiang, Lin Liu |
Cartesian contour: a concise representation for a collection of frequent sets. |
KDD |
2009 |
DBLP DOI BibTeX RDF |
concise pattern representation, frequent itemsets, set cover, cartesian product |
| 1 | Yossi Azar, Iftah Gamzu, Xiaoxin Yin |
Multiple intents re-ranking. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
min-sum set cover, minimum latency set cover, multiple intents, approximation algorithms, ranking |
| 1 | Yuichi Yoshida, Masaki Yamamoto, Hiro Ito |
An improved constant-time approximation algorithm for maximum~matchings. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
constant-time approximation algorithms, minimum vertex cover, property testing, maximum matching, minimum set cover |
| 1 | Zhao Zhang, Xiaofeng Gao, Xuefei Zhang, Weili Wu, Hui Xiong |
Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System. |
DEXA |
2009 |
DBLP DOI BibTeX RDF |
Fault Tolerance, Set Cover, Sensor Database |
| 1 | Liang Chen, Jason Crampton |
Set Covering Problems in Role-Based Access Control. |
ESORICS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Junyu Liu, Yubao Liu, Yan Long |
Integrating Rough Set and Genetic Algorithm for Negative Rule Extraction. |
IDEAL |
2009 |
DBLP DOI BibTeX RDF |
Negative Rule, Genetic Algorithm, Rough Sets, Rule Extraction |
| 1 | Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis |
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Approximation algorithms, Combinatorial optimization, Set cover |
| 1 | Pauli Miettinen |
On the Positive-Negative Partial Set Cover problem. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Mira Gonen, Yuval Shavitt |
An O(log n)-approximation for the Set Cover Problem with Set Ownership |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Asaf Levin |
Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Doina Logofatu, Rolf Drechsler |
Comparative Study by Solving the Test Compaction Problem. |
ISMVL |
2008 |
DBLP DOI BibTeX RDF |
Backtracking, Multi-Valued Logic, Test Compaction, Set Cover Problem, Greedy, Don't Cares |
| 1 | Francesco Bonchi, Carlos Castillo, Debora Donato, Aristides Gionis |
Topical query decomposition. |
KDD |
2008 |
DBLP DOI BibTeX RDF |
query recommendation, clustering, set cover |
| 1 | Thomas Erlebach, Erik Jan van Leeuwen |
Approximating geometric coverage problems. |
SODA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Grandoni, Anupam Gupta, Stefano Leonardi, Pauli Miettinen, Piotr Sankowski, Mohit Singh |
Set Covering with our Eyes Closed. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dietrich Kuske, Markus Lohrey |
Hamiltonicity of automatic graphs. |
IFIP TCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Peter Widmayer, Anna Zych |
Reoptimization of Weighted Graph and Covering Problems. |
WAOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Tight Results on Minimum Entropy Set Cover. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Entropy, Greedy algorithm, Hardness of approximation, Set cover |
| 1 | Steven Noel, Sushil Jajodia |
Optimal IDS Sensor Placement and Alert Prioritization Using Attack Graphs. |
J. Network Syst. Manage. |
2008 |
DBLP DOI BibTeX RDF |
Topological vulnerability analysis, Intrusion detection, Attack graphs, Sensor placement |
| 1 | Tobias Friedrich, Nils Hebbinghaus, Frank Neumann, Jun He, Carsten Witt |
Approximating covering problems by randomized search heuristics using multi-objective models. |
GECCO |
2007 |
DBLP DOI BibTeX RDF |
combinatorial optimization, multi-objective optimization, runtime analysis, covering problems |
| 1 | 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. |
IEEE/ACM Trans. Comput. Biology Bioinform. |
2007 |
DBLP DOI BibTeX RDF |
graph algorithms, genetics, biology, bioinformatics (genome or protein) databases, Computations on discrete structures |
| 1 | Feng Pan, Adam Roberts, Leonard McMillan, David Threadgill, Wei Wang 0010 |
Sample Selection for Maximal Diversity. |
ICDM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kuei-Ping Shih, Hung-Chang Chen, Bo-Jun Liu |
Integrating Target Coverage and Connectivity for Wireless Heterogeneous Sensor Networks with Multiple Sensing Units. |
ICON |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kuei-Ping Shih, San-Yuan Wang, Hung-Chang Chen, Bo-Jun Liu |
On Target Coverage in Wireless Heterogeneous Sensor Networks with Multiple Sensing Units. |
ISCC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kedarnath J. Balakrishnan, Nur A. Touba |
Relationship Between Entropy and Test Data Compression. |
IEEE Trans. on CAD of Integrated Circuits and Systems |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Joel Friedman |
Linear Transformations in Boolean Complexity Theory. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Boolean circuit complexity, linear transformations, cohomology |
| 1 | Stavros Athanassopoulos, Ioannis Caragiannis, Christos Kaklamanis |
Analysis of Approximation Algorithms for k-Set Cover Using Factor-Revealing Linear Programs. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Paz Carmi, Matthew J. Katz, Nissan Lev-Tov |
Covering Points by Unit Disks of Fixed Location. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hua Wang, Zuquan Ge, Jun Ma |
Self-adaptive Lagrange Relaxation Algorithm for Aggregated Multicast. |
SOFSEM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette |
The Minimum Substring Cover Problem. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit S. Hochbaum, Asaf Levin |
Covering the Edges of Bipartite Graphs Using K 2, 2 Graphs. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
Approximation algorithms, network design, set cover |
| 1 | Kenneth L. Clarkson, Kasturi R. Varadarajan |
Improved Approximation Algorithms for Geometric Set Cover. |
Discrete & Computational Geometry |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Torsten Fahle, Karsten Tiemann |
A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. |
ACM Journal of Experimental Algorithmics |
2006 |
DBLP DOI BibTeX RDF |
test-cover problem, variable fixing, Branch-and-bound, Lagrangian relaxation, set-cover problem |
| 1 | Yigal Bejerano, Rajeev Rastogi |
Robust monitoring of link delays and faults in IP networks. |
IEEE/ACM Trans. Netw. |
2006 |
DBLP DOI BibTeX RDF |
latency and fault monitoring, approximation algorithms, set cover problem, network failures |
| 1 | Guolong Lin, Chandrashekhar Nagarajan, Rajmohan Rajaraman, David P. Williamson |
A general approach for incremental approximation and hierarchical clustering. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vitaly Feldman |
Hardness of approximate two-level logic minimization and PAC learning with membership queries. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
DNF minimization, proper learning, two-level logic minimization, hardness of approximation, uniform distribution, membership queries, truth table |
| 1 | Jean Cardinal, Samuel Fiorini, Gwenaël Joret |
Tight Results on Minimum Entropy Set Cover. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz, Zeev Nutov |
Tight Approximation Algorithm for Connectivity Augmentation Problems. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Dom, Jiong Guo, Rolf Niedermeier, Sebastian Wernicke |
Minimum Membership Set Covering and the Consecutive Ones Property. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Rooted Connectivity Augmentation Problems. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
Rooted connectivity, Augmentation problems, Approximation algorithms, Hardness of approximation |
| 1 | Eran Halperin, Richard M. Karp |
The minimum-entropy set cover problem. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Asaf Levin |
A Better-Than-Greedy Approximation Algorithm for the Minimum Set Cover Problem. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Wenbin Liu, Xiangou Zhu, Guandong Xu, Qiang Zhang, Lin Gao |
A DNA Based Evolutionary Algorithm for the Minimal Set Cover Problem. |
ICIC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Jennifer Widom |
The Pipelined Set Cover Problem. |
ICDT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger |
Interference in Cellular Networks: The Minimum Membership Set Cover Problem. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kenneth L. Clarkson, Kasturi R. Varadarajan |
Improved approximation algorithms for geometric set cover. |
Symposium on Computational Geometry |
2005 |
DBLP DOI BibTeX RDF |
algorithms, approximation, set cover |
| 1 | Noga Alon, Yossi Azar, Shai Gutner |
Admission control to minimize rejections and online set cover with repetitions. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
admission control, competitive, set cover, on-line |
| 1 | Avi Wigderson, David Xiao |
A Randomness-Efficient Sampler for Matrix-valued Functions and Applications. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Quanhong Wang, Kenan Xu, Hossam S. Hassanein, Glen Takahara |
Minimum cost guaranteed lifetime design for heterogeneous wireless sensor networks (WSNs). |
IPCCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcin Bienkowski, Jaroslaw Byrka |
Bucket Game with Applications to Set Multicover and Dynamic Page Migration. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Refael Hassin, Danny Segev |
The Set Cover with Pairs Problem. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vineet Bafna, Vikas Bansal |
Improved Recombination Lower Bounds for Haplotype Data. |
RECOMB |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Toshihiro Fujito, Hidekazu Kurahashi |
A Better-Than-Greedy Algorithm for k-Set Multicover. |
WAOA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Reuven Bar-Yehuda, Zehavit Kehat |
Approximating the dense set-cover problem. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Halperin, Richard M. Karp |
The Minimum-Entropy Set Cover Problem. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Eran Halperin, Richard M. Karp |
Perfect phylogeny and haplotype assignment. |
RECOMB |
2004 |
DBLP DOI BibTeX RDF |
entropy, haplotypes, phasing, perfect phylogeny |
| 1 | David B. Shmoys, Chaitanya Swamy, Retsef Levi |
Facility location with Service Installation Costs. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sule Ozev, Alex Orailoglu |
End-to-End Testability Analysis and DfT Insertion for Mixed-Signal Paths. |
ICCD |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, László Lovász, Prasad Tetali |
Approximating Min Sum Set Cover. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Threshhold, NP-hardness, Greedy algorithm, Randomized rounding |
| 1 | Toshihiro Fujito |
On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover. |
J. Comb. Optim. |
2004 |
DBLP DOI BibTeX RDF |
covering integer program, approximation algorithm, combinatorial optimization, partial cover |
| 1 | Edith Cohen, Amos Fiat, Haim Kaplan |
Efficient sequences of trials. |
SODA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hunsoo Choo, Khurram Muhammad, Kaushik Roy |
MRPF: An Architectural Transformation for Synthesis of High-Performance and Low-Power Digital Filters. |
DATE |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Sakthi Balan |
String Binding-Blocking Automata. |
GECCO |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov |
Approximating Rooted Connectivity Augmentation Problems. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Julia Chuzhoy, Joseph Naor |
Covering Problems with Hard Capacities. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Uriel Feige, László Lovász, Prasad Tetali |
Approximating Min-sum Set Cover. |
APPROX |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Lujun Jia, Rajmohan Rajaraman, Torsten Suel |
An efficient distributed algorithm for constructing small dominating sets. |
Distributed Computing |
2002 |
DBLP DOI BibTeX RDF |
Ad hoc network, Approximation algorithm, Distributed computing, Dominating set |
| 1 | Luca Trevisan |
Non-approximability results for optimization problems on bounded degree instances. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Sakthi Balan, Kamala Krithivasan, Y. Sivasubramanyam |
Peptide Computing - Universality and Complexity. |
DNA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Eidenbenz, Christoph Stamm, Peter Widmayer |
Inapproximability Results for Guarding Polygons and Terrains. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz |
On the Hardness of Approximating Spanners. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert D. Carr, Srinivas Doddi, Goran Konjevod, Madhav V. Marathe |
On the red-blue set cover problem. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Tatsuya Akutsu, Satoru Miyano, Satoru Kuhara |
A Simple Greedy Algorithm for Finding Functional Relations: Efficient Implementation and Average Case Anaylsis. |
Discovery Science |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | David Peleg |
Approximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | John H. Reif |
Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input. |
Algorithmica |
2000 |
DBLP DOI BibTeX RDF |
Visibility problems, Gap-preserving reductions, Telecommunications, Terrains, Inapproximability, Art gallery |
| 1 | Toshihiro Fujito |
On approximation of the submodular set cover problem. |
Oper. Res. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Guy Kortsarz |
On the Hardness of Approximation Spanners. |
APPROX |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Gambosi, Marco Protasi, Maurizio Talamo |
Preserving Approximation in the Min-Weighted Set Cover Problem. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")