Search results for "minimum set cover"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	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	Yang Yu, Xin Yao, Zhi-Hua Zhou	On the approximation ability of evolutionary optimization with application to minimum set cover.	Artif. Intell.	2012	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey A. Stepanov	Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications.	ACM Transactions on Algorithms	2008	DBLP DOI BibTeX RDF	Exact exponential algorithms, domatic number, listing algorithms, measure and conquer, minimum dominating set, minimum set cover
1	Li Yang	Alignment of Overlapping Locally Scaled Patches for Multidimensional Scaling and Dimensionality Reduction.	IEEE Trans. Pattern Anal. Mach. Intell.	2008	DBLP DOI BibTeX RDF
1	Larry Raisanen	A permutation-coded evolutionary strategy for multi-objective GSM network planning.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Cell planning, GSM network planning, Evolutionary algorithm, Multiobjective, Permutation-coded
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	Alberto Aloisio, Vincenzo Izzo, Salvatore Rampone	VLSI implementation of greedy-based distributed routing schemes for ad hoc networks.	Soft Comput.	2007	DBLP DOI BibTeX RDF	Greedy algorithm, Ad hoc wireless network, FPGA implementation, Minimum set cover
1	Masayoshi Kobayashi, Tutomu Murase	Scalable QoS Degradation Locating from End-to-End Quality of Flows on Various Routes.	SAINT Workshops	2007	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	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	Dmitri Kaznachey, Arun K. Jagota	Approximating Minimum Set Cover in a Hopfield-Style Network.	Inf. Sci.	1997	DBLP DOI BibTeX RDF
1	Petr Slavík	Improved Performance of the Greedy Algorithm for the Minimum Set Cover and Minimum Partial Cover Problems	Electronic Colloquium on Computational Complexity (ECCC)	1995	DBLP BibTeX RDF
1	Sreejit Chakravarty, Ajay Shekhawat	Parallel and serial heuristics for the minimum set cover problem.	The Journal of Supercomputing	1992	DBLP DOI BibTeX RDF
1	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.	IEEE Trans. Computers	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
1	Edmund Ihler	The Complexity of Approximating the Class Steiner Tree Problem.	WG	1991	DBLP DOI BibTeX RDF
1	Constantine N. K. Osiakwan, Selim G. Akl	Optimal Parallel Algorithms for b-Matchings in Trees.	Optimal Algorithms	1989	DBLP DOI BibTeX RDF	postorder numbering, parallel algorithm, tree, matching, maximum independent set, EREW PRAM, b - matching, minimum set cover
1	Gregory Piatetsky-Shapiro	The Optimal Selection of Secondary Indices is NP-Complete.	SIGMOD Record	1983	DBLP DOI BibTeX RDF