Search results for "Covering"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	V. S. Anil Kumar 0001, Sunil Arya, H. Ramesh	Hardness of Set Cover with Intersection 1.	ICALP	2000	DBLP DOI BibTeX RDF
22	Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle	Complexity of Colored Graph Covers I. Colored Directed Multigraphs.	WG	1997	DBLP DOI BibTeX RDF
21	Anureet Saxena, Vineet Goyal, Miguel A. Lejeune	MIP reformulations of the probabilistic set covering problem.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 90C15, 90-08, 90C10
21	Taiga Takata, Yusuke Matsunaga	A heuristic algorithm for LUT-based FPGA technology mapping using the lower bound for DAG covering problem (abstract only).	FPGA	2010	DBLP DOI BibTeX RDF	fpga, technology mapping
21	Michael Navon, Alex Samorodnitsky	Linear Programming Bounds for Codes via a Covering Argument.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Linear programming bounds for codes, Discrete Fourier transform
21	Tae-Seok Lee, Jeong-Sik Choi, Jeong Hee Lee, Beom Hee Lee 0001	3-D terrain covering and map building algorithm for an AUV.	IROS	2009	DBLP DOI BibTeX RDF
21	Andrew L. Burrow	Algorithm Design Using Traversals of the Covering Relation.	ICCS	2009	DBLP DOI BibTeX RDF
21	Gerzson Kéri	The covering radius of extreme binary 2-surjective codes.	Des. Codes Cryptogr.	2008	DBLP DOI BibTeX RDF	AMS Classifications 94B75, 05C70, 05C65, 94B25
21	Moshe Laifenfeld, Ari Trachtenberg	Identifying Codes and Covering Problems.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
21	Peter Danziger, Eric Mendelsohn, Lucia Moura, Brett Stevens	Covering Arrays Avoiding Forbidden Edges.	COCOA	2008	DBLP DOI BibTeX RDF
21	Claude Carlet, Sihem Mesnager	Improving the Upper Bounds on the Covering Radii of Binary Reed-Muller Codes.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
21	Florian Diedrich, Klaus Jansen	An Approximation Algorithm for the General Mixed Packing and Covering Problem.	ESCAPE	2007	DBLP DOI BibTeX RDF
21	Chandan Saha 0001, Sandip Das 0001	Covering a Set of Points in a Plane Using Two Parallel Rectangles.	ICCTA	2007	DBLP DOI BibTeX RDF
21	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
21	William Zhu 0001, Fei-Yue Wang 0001	Topological Properties in Covering-Based Rough Sets.	FSKD (1)	2007	DBLP DOI BibTeX RDF
21	Bin Fu, Zhixiang Chen 0001, Mahdi Abdelguerfi	An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem.	AAIM	2007	DBLP DOI BibTeX RDF
21	Ian Cloete, Jacobus van Zyl	Fuzzy rule induction in a set covering framework.	IEEE Trans. Fuzzy Syst.	2006	DBLP DOI BibTeX RDF
21	Mingen Lin, Yang Yang 0012, Jinhui Xu 0001	Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems.	ISAAC	2006	DBLP DOI BibTeX RDF
21	Jochen Könemann, Ojas Parekh, Danny Segev	A Unified Approach to Approximating Partial Covering Problems.	ESA	2006	DBLP DOI BibTeX RDF
21	Érick Alphonse, Aomar Osmani	On the Connection Between the Phase Transition of the Covering Test and the Learning Success Rate.	ILP	2006	DBLP DOI BibTeX RDF
21	Alexander N. Dolia, Tijl De Bie, Christopher J. Harris 0001, John Shawe-Taylor, D. M. Titterington	The Minimum Volume Covering Ellipsoid Estimation in Kernel-Defined Feature Spaces.	ECML	2006	DBLP DOI BibTeX RDF
21	Nysret Musliu	Local Search Algorithm for Unicost Set Covering Problem.	IEA/AIE	2006	DBLP DOI BibTeX RDF
21	Su Yang, Jianning Liang, Yuanyuan Wang 0001, Adam C. Winstanley	Feature Selection Based on Run Covering.	PSIVT	2006	DBLP DOI BibTeX RDF
21	Iwona Cieslik	On-line coloring and cliques covering for KKs, t-free graphs.	Acta Informatica	2005	DBLP DOI BibTeX RDF
21	Yuri L. Borissov, An Braeken, Svetla Nikova, Bart Preneel	On the covering radii of binary Reed-Muller codes in the set of resilient Boolean functions.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
21	Jean-Louis Verger-Gaugry	Covering a Ball with Smaller Equal Balls in Rn.	Discret. Comput. Geom.	2005	DBLP DOI BibTeX RDF
21	S. Muthukrishnan 0001, Gopal Pandurangan	The bin-covering technique for thresholding random geometric graph properties.	SODA	2005	DBLP BibTeX RDF
21	Dimitri P. Solomatine	Adaptive cluster covering and evolutionary approach: comparison, differences and similarities.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
21	Kedar Dhamdhere, Vineet Goyal, R. Ravi 0001, Mohit Singh	How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems.	FOCS	2005	DBLP DOI BibTeX RDF
21	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Parameterized Counting Algorithms for General Graph Covering Problems.	WADS	2005	DBLP DOI BibTeX RDF
21	John H. Holmes, Jennifer A. Sager, Warren B. Bilker	Three Methods for Covering Missing Input Data in XCS.	IWLCS	2005	DBLP DOI BibTeX RDF
21	Guoli Li, Shuang Hou, Hans-Arno Jacobsen	A Unified Approach to Routing, Covering and Merging in Publish/Subscribe Systems Based on Modified Binary Decision Diagrams.	ICDCS	2005	DBLP DOI BibTeX RDF
21	Junping Zhang, Stan Z. Li, Jue Wang 0004	Geometrical Probability Covering Algorithm.	FSKD (1)	2005	DBLP DOI BibTeX RDF
21	Giorgio Delzanno, Jean-François Raskin, Laurent Van Begin	Covering sharing trees: a compact data structure for parameterized verification.	Int. J. Softw. Tools Technol. Transf.	2004	DBLP DOI BibTeX RDF	Efficient data structures, Heuristics, Static analysis, Constraints, Symbolic model checking, Infinite-state systems
21	Michael G. Dimopoulos, Panagiotis Linardis	Efficient Static Compaction of Test Sequence Sets through the Application of Set Covering Techniques.	DATE	2004	DBLP DOI BibTeX RDF
21	Ian Cloete, Jacobus van Zyl	A machine learning framework for fuzzy set covering algorithms.	SMC (4)	2004	DBLP DOI BibTeX RDF
21	Hadas Shachnai, Oded Shmueli, Robert Sayegh	Approximation Schemes for Deal Splitting and Covering Integer Programs with Multiplicity Constraints.	WAOA	2004	DBLP DOI BibTeX RDF
21	Stefan Porschen	On the Time Complexity of Rectangular Covering Problems in the Discrete Plane.	ICCSA (3)	2004	DBLP DOI BibTeX RDF	rectangular set cover, integer lattice, NP-completeness, discrete plane
21	Yuanqing Guo, Gerard J. M. Smit, Hajo Broersma, Paul M. Heysters	A graph covering algorithm for a coarse grain reconfigurable system.	LCTES	2003	DBLP DOI BibTeX RDF	template generation, compiler, reconfigurable system
21	Rolly Intan, Masao Mukaidono	Generating Fuzzy Thesaurus by Degree of Similarity in Fuzzy Covering.	ISMIS	2003	DBLP DOI BibTeX RDF
21	Ralf Franken, Stephen D. Cohen	The Covering Radius of Some Primitive Ternary BCH Codes.	International Conference on Finite Fields and Applications	2003	DBLP DOI BibTeX RDF
21	Vasco M. Manquinho, João P. Marques Silva	Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2002	DBLP DOI BibTeX RDF
21	Klaus Jansen, Roberto Solis-Oba	An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering.	ISAAC	2002	DBLP DOI BibTeX RDF
21	Roberto Esposito, Lorenza Saitta	Is a Greedy Covering Strategy an Extreme Boosting?	ISMIS	2002	DBLP DOI BibTeX RDF
21	Jirí Fiala 0001, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle	Generalized H-Coloring and H-Covering of Trees.	WG	2002	DBLP DOI BibTeX RDF
21	Christian Plessl, Marco Platzner	Custom Computing Machines for the Set Covering Problem.	FCCM	2002	DBLP DOI BibTeX RDF
21	Markus Finger, Thomas Stützle, Helena R. Lourenço	Exploiting Fitness Distance Correlation of Set Covering Problems.	EvoWorkshops	2002	DBLP DOI BibTeX RDF
21	Aravind Srinivasan	New approaches to covering and packing problems.	SODA	2001	DBLP BibTeX RDF
21	Evguenii I. Goldberg, Luca P. Carloni, Tiziano Villa, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli	Negative thinking in branch-and-bound: the case of unate covering.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2000	DBLP DOI BibTeX RDF
21	Yossi Azar, Leah Epstein	Approximation Schemes for Covering and Scheduling on Related Machines.	APPROX	1998	DBLP DOI BibTeX RDF
21	Tiziano Villa, Timothy Kam, Robert K. Brayton, Alberto L. Sangiovanni-Vincentelli	Explicit and implicit algorithms for binate covering problems.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1997	DBLP DOI BibTeX RDF
21	François Vernadat 0001, Pierre Azéma, François Michel	Covering Step Graph.	Application and Theory of Petri Nets	1996	DBLP DOI BibTeX RDF	partial-order, concurrent systems, state space exploration, verification methods
21	E. Kolev, Ivan N. Landgev	On Some Mixed Covering Codes of Small Length.	Algebraic Coding	1993	DBLP DOI BibTeX RDF
21	Alain Finkel, Laure Petrucci	Avoiding State Exposion by Composition of Minimal Covering Graphs.	CAV	1991	DBLP DOI BibTeX RDF
21	Dorit S. Hochbaum, Wolfgang Maass 0001	Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI	J. ACM	1985	DBLP DOI BibTeX RDF
21	Heeralal Janwa, H. F. Mattson Jr.	Covering Radii of Even Subcodes of t-dense Codes.	AAECC	1985	DBLP DOI BibTeX RDF
21	H. F. Mattson Jr.	An improved upper bound on covering radius.	AAECC	1984	DBLP DOI BibTeX RDF
21	Gerard Salton	Covering the computer field.	Commun. ACM	1967	DBLP DOI BibTeX RDF
20	Arijit Bishnu, Mathew C. Francis, Pritam Majumder	Geometric Covering Number: Covering Points with Curves.	CALDAM	2024	DBLP DOI BibTeX RDF
20	Alexander A. Davydov, Stefano Marcugini, Fernanda Pambianco	Upper bounds on the length function for covering codes with covering radius $ R $ and codimension $ tR+1 $.	Adv. Math. Commun.	2023	DBLP DOI BibTeX RDF
20	Xiao Shang, Pei Wang, Ronghuo Wu, Hanyu E	Continuous Mapping of Covering Approximation Spaces and Topologies Induced by Arbitrary Covering Relations.	Symmetry	2023	DBLP DOI BibTeX RDF
20	Liang Chen, Sheng-Jie Chen, Weikun Chen, Yu-Hong Dai, Tao Quan, Juan Chen	Efficient presolving methods for solving maximal covering and partial set covering location problems.	Eur. J. Oper. Res.	2023	DBLP DOI BibTeX RDF
20	André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens	Bounds on Covering Codes in RT spaces using Ordered Covering Arrays.	CoRR	2022	DBLP DOI BibTeX RDF
20	André Guerino Castoldi, Emerson L. Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens	Ordered Covering Arrays and Upper Bounds on Covering Codes in NRT spaces.	CoRR	2022	DBLP DOI BibTeX RDF
20	Lei Yu, Xinmin Hou, Yue Ma, Boyuan Liu	Exact Minimum Codegree Thresholds for $K_4^-$-Covering and $K_5^-$-Covering.	Electron. J. Comb.	2020	DBLP DOI BibTeX RDF
20	Liting Xu, Jinjin Li 0001, Peiqiu Yu	Updating reducts in fuzzy $$\beta $$-covering via matrix approaches while coarsening and refining a covering element.	J. Appl. Math. Comput.	2020	DBLP DOI BibTeX RDF
20	Jose Torres-Jimenez, Idelfonso Izquierdo-Marquez	Improved covering arrays using covering perfect hash families with groups of restricted entries.	Appl. Math. Comput.	2020	DBLP DOI BibTeX RDF
20	Aditya Potukuchi, Yihan Zhang 0001	Improved efficiency for covering codes matching the sphere-covering bound.	ISIT	2020	DBLP DOI BibTeX RDF
20	Sang-Eon Han	Covering rough set structures for a locally finite covering approximation space.	Inf. Sci.	2019	DBLP DOI BibTeX RDF
20	Zhengang Zhao	Maps between covering approximation spaces and the product space of two covering approximation spaces.	Int. J. Approx. Reason.	2019	DBLP DOI BibTeX RDF
20	Aditya Potukuchi, Yihan Zhang 0001	Improved efficiency for explicit covering codes matching the sphere-covering bound.	CoRR	2019	DBLP BibTeX RDF
20	Jean-François Cordeau, Fabio Furini, Ivana Ljubic	Benders decomposition for very large scale partial set covering and maximal covering location problems.	Eur. J. Oper. Res.	2019	DBLP DOI BibTeX RDF
20	André Guerino Castoldi, Emerson Luiz do Monte Carmelo, Lucia Moura, Daniel Panario, Brett Stevens	Bounds on Covering Codes in RT Spaces Using Ordered Covering Arrays.	CAI	2019	DBLP DOI BibTeX RDF
20	Charles J. Colbourn, Erin Lanus, Kaushik Sarkar	Asymptotic and constructive methods for covering perfect hash families and covering arrays.	Des. Codes Cryptogr.	2018	DBLP DOI BibTeX RDF
20	Zhongzheng Tang, Zhuo Diao	Approximation algorithms on k-cycle covering and k-clique covering.	CoRR	2018	DBLP BibTeX RDF
20	Amey Bhangale, Rajiv Gandhi, Mohammad Taghi Hajiaghayi, Rohit Khandekar, Guy Kortsarz	Bi-Covering: Covering Edges with Two Small Subsets of Vertices.	SIAM J. Discret. Math.	2017	DBLP DOI BibTeX RDF
20	Guangming Lang, Duoqian Miao, Tian Yang, Mingjie Cai	Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities.	Inf. Sci.	2016	DBLP DOI BibTeX RDF
20	Ali Shakiba, Mohammad Reza Hooshmandasl	Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets.	Int. J. Approx. Reason.	2016	DBLP DOI BibTeX RDF
20	Hua Yao, William Zhu 0001	Condition for neighbourhoods induced by a covering to be equal to the covering itself.	Int. J. Granul. Comput. Rough Sets Intell. Syst.	2014	DBLP DOI BibTeX RDF
20	Bin Yang 0004, William Zhu 0001	Covering-based rough sets on covering-circuit matroids.	FSKD	2014	DBLP DOI BibTeX RDF
20	Oded Berman, Zvi Drezner, Dmitry Krass	Continuous covering and cooperative covering problems with a general decay function on networks.	J. Oper. Res. Soc.	2013	DBLP DOI BibTeX RDF
20	Aymeric Hervieu	Approche à contraintes pour la sélection de Covering Array. (Covering Array generation using constraint programming).		2013	RDF
20	Xun Ge, Xiaole Bai, Ziqiu Yun	Topological characterizations of covering for special covering-based upper approximation operators.	Inf. Sci.	2012	DBLP DOI BibTeX RDF
20	Yanfang Liu, William Zhu 0001	The role of covering matroid in covering-based rough set and matroid	CoRR	2012	DBLP BibTeX RDF
20	Hua Yao, William Zhu 0001	Condition for neighborhoods induced by a covering to be equal to the covering itself	CoRR	2012	DBLP BibTeX RDF
20	Qiu Jin, Lingqiang Li, Shoubin Sun	On covering generalized rough set: Covering rough membership function.	FSKD	2012	DBLP DOI BibTeX RDF
20	Shiping Wang, Fan Min 0001, William Zhu 0001	Covering Numbers in Covering-Based Rough Sets.	RSFDGrC	2011	DBLP DOI BibTeX RDF
20	Charles J. Colbourn, Gerzson Kéri, P. P. Rivas Soriano, Jan-Christoph Schlage-Puchta	Covering and radius-covering arrays: Constructions and classification.	Discret. Appl. Math.	2010	DBLP DOI BibTeX RDF
20	José R. Correa, Asaf Levin	Monotone Covering Problems with an Additional Covering Constraint.	Math. Oper. Res.	2009	DBLP DOI BibTeX RDF
20	Degang Chen 0002, Changzhong Wang, Qinghua Hu	A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets.	Inf. Sci.	2007	DBLP DOI BibTeX RDF
20	Tínaz Ekim, Vangelis Th. Paschos	Approximation preserving reductions for set covering, vertex covering and independent set hierarchies under differential approximation.	Int. J. Comput. Math.	2004	DBLP DOI BibTeX RDF
20	Maria Madonia, Sergio Salemi, Tecla Sportelli	Covering Submonoids and Covering Codes.	J. Autom. Lang. Comb.	1999	DBLP DOI BibTeX RDF
20	Yair Caro, Raphael Yuster	Covering Graphs: The Covering Problem Solved.	J. Comb. Theory, Ser. A	1998	DBLP DOI BibTeX RDF
20	Zhen Zhang 0010, Chiaming Lo	Linear inequalities for covering codes: Part II: Triple covering inequalities.	IEEE Trans. Inf. Theory	1992	DBLP DOI BibTeX RDF
20	Charles Delorme, Patrick Solé	Diameter, Covering Index, Covering Radius and Eigenvalues.	Eur. J. Comb.	1991	DBLP DOI BibTeX RDF
20	Ernst M. Gabidulin, Alexander A. Davydov, Leonid M. Tombak	Linear codes with covering radius 2 and other new covering codes.	IEEE Trans. Inf. Theory	1991	DBLP DOI BibTeX RDF
20	Zhen Zhang 0010	Linear inequalities for covering codes: Part I: Pair covering inequalities.	IEEE Trans. Inf. Theory	1991	DBLP DOI BibTeX RDF
19	Byunghyun Lee, Ki-Seok Chung, Bontae Koo, Nak-Woong Eum, Taewhan Kim	Thermal sensor allocation and placement for reconfigurable systems.	ACM Trans. Design Autom. Electr. Syst.	2009	DBLP DOI BibTeX RDF	optimal placement, unate-covering problem, reconfigurable system, Thermal sensor
19	Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky	Coloring Geometric Range Spaces.	Discret. Comput. Geom.	2009	DBLP DOI BibTeX RDF	Geometric hypergraphs, Decompositions, Coloring, Covering
19	Guy Kortsarz, Zeev Nutov	Approximating Some Network Design Problems with Node Costs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF	Node costs, Multicommodity Buy at Bulk, Covering tree, Approximation algorithm, Network design, Hardness of approximation