共检索到2,596条结果
年份
全部
订阅
收起
  • [外文期刊] Gadouleau M. Zhiyuan Yan 《IEEE Transactions on Information Theory》, ISTIC EI SCI PKU CSSCI 2008 9
    This paper investigates packing and covering properties of codes with the rank metric. First, we investigate packing properties of rank metric codes. Then, we study sphere covering properties of rank m...
    codesasymptotic covering propertypacking-and-covering propertyrank metric codesphere covering propertyCovering radiuserror control codesrank metric codes
  • [外文期刊] Vogt L Poojari CA Beasley JE 《The Journal of the Operational Research Society》, ISTIC EI SCI PKU CSSCI 2007 4
    In the single vehicle routing allocation problem (SVRAP) we have a single vehicle, together with a set of customers, and the problem is one of deciding a route for the vehicle (starting and ending at g...
    tabu searchmedian cycle problemring star problemcovering tour problemcovering salesman problemshortest covering path problemTRAVELING-SALESMAN PROBLEMCOVERING PATH PROBLEM
  • [外文期刊] Taha Ghasemi Mohammadreza Razzazi 《Theoretical computer science》, ISTIC EI SCI PKU CSSCI 2014
    In this paper, we address the cardinality constrained covering with unit balls problem: given a positive integer L and a set of n points in R~d, partition them into a minimum number of parts such that ...
    Cardinality constrained coveringCapacitated coveringCovering with disksFully polynomial time approximation algorithmComputational geometry
  • [外文期刊] Wang, C. He, Q. Chen, D. Hu, Q. 《Information Sciences: An International Journal》, ISTIC EI SCI PKU CSSCI 2014
    Attribute reduction has become an important step in pattern recognition and machine learning tasks. Covering rough sets, as a generalization of classical rough sets, have attracted wide attention in bo...
    Attribute reductionConsistent covering decision systemCovering rough setDiscernibility matrixInconsistent covering decision system
  • [外文期刊] SYLVIA BOYD SATORU IWATA KENJIRO TAKAZAWA 《SIAM journal on discrete mathematics》, ISTIC EI SCI PKU CSSCI 2013 2
    In this paper we are interested in algorithms for finding 2-factors that cover certain prescribed edge-cuts in bridgeless cubic graphs. Since a Hamilton cycle is a 2-factor covering all edge-cuts, impo...
    bridgeless cubic graphsminimum-weight 2-factor covering 3-edge cutspolyhedral description of 2-factors covering 3-edge cuts2-factor covering 3- and 4-edge cutsminimum 2-edge-connected spanning subgraphs
  • [外文期刊] Park, B. Kim, S.-R. Kim, H.K. 《Journal of combinatorial optimization》, ISTIC EI SCI PKU CSSCI 2013 4
    In this paper, we study cooperative games arising from integer edge covering problems on graphs. We introduce two games, a rigid k-edge covering game and its relaxed game, as generalizations of a rigid...
    Decomposition theoremsEdge covering problemsInteger edge covering functions of graphsInteger edge covering problems on graphs
  • [外文期刊] Francetic?, N. Danziger, P. Mendelsohn, E. 《Journal of combinatorial designs》, ISTIC EI SCI PKU CSSCI 2013 7/8
    A k-GDCD, group divisible covering design, of type gu is a triple (V,G,B), where V is a set of gu elements, G is a partition of V into u sets of size g, called groups, and B is a collection of k-subset...
    covering arrays with row limitgraph covering problemgroup divisible covering designsgroup divisible designsorthogonal arrays
  • [外文期刊] Zhang, Y.-L. Luo, M.-K. 《Information Sciences: An International Journal》, ISTIC EI SCI PKU CSSCI 2013
    Rough set theory is an important technique to deal with vagueness and granularity in information systems. In rough set theory, relation-based rough sets and covering-based rough sets are two important ...
    Binary relationCoveringCovering-based approximation operatorCovering-based rough setRelation-based rough set
  • [外文期刊] Du, Y. Hu, Q. Zhu, P. Ma, P. 《Information Sciences: An International Journal》, ISTIC EI SCI PKU CSSCI 2011 24
    Rough set theory has been extensively discussed in the domain of machine learning and data mining. Pawlaks rough set theory offers a formal theoretical framework for attribute reduction and rule learni...
    Covering reductionNeighborhood coveringRelative covering reductionRough setRule learning
  • [外文期刊] REUVEN BAR-YEHUDA GUY FLYSHER JULIAN MESTRE DROR RAWITZ 《SIAM journal on discrete mathematics》, ISTIC EI SCI PKU CSSCI 2011 4
    We study the partial capacitated vertex cover problem (PCVC) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (or load) e(e), and each...
    approximation algorithmscapacitated coveringlocal ratio techniquepartial coveringprize collecting covering
回到顶部
选择了条数据