咨询与建议

限定检索结果

文献类型

  • 239 篇 期刊文献
  • 43 篇 会议

馆藏范围

  • 282 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 165 篇 工学
    • 130 篇 计算机科学与技术...
    • 30 篇 电气工程
    • 26 篇 软件工程
    • 15 篇 电子科学与技术(可...
    • 9 篇 机械工程
    • 9 篇 信息与通信工程
    • 8 篇 控制科学与工程
    • 3 篇 石油与天然气工程
    • 2 篇 动力工程及工程热...
    • 2 篇 交通运输工程
    • 1 篇 力学(可授工学、理...
    • 1 篇 土木工程
    • 1 篇 化学工程与技术
  • 164 篇 理学
    • 163 篇 数学
    • 3 篇 系统科学
    • 2 篇 生物学
    • 2 篇 统计学(可授理学、...
  • 88 篇 管理学
    • 88 篇 管理科学与工程(可...
    • 19 篇 工商管理
    • 2 篇 图书情报与档案管...
  • 19 篇 经济学
    • 17 篇 应用经济学
    • 2 篇 理论经济学
  • 2 篇 法学
    • 2 篇 法学
  • 2 篇 医学
    • 2 篇 临床医学
    • 1 篇 基础医学(可授医学...
  • 2 篇 军事学
  • 1 篇 农学

主题

  • 282 篇 polynomial time ...
  • 21 篇 np-complete
  • 19 篇 computational co...
  • 17 篇 scheduling
  • 13 篇 approximation al...
  • 12 篇 np-completeness
  • 11 篇 domination
  • 11 篇 combinatorial op...
  • 7 篇 np-hard
  • 7 篇 discrete tomogra...
  • 7 篇 complexity
  • 6 篇 efficient edge d...
  • 6 篇 traveling salesm...
  • 6 篇 graph algorithms
  • 6 篇 dynamic programm...
  • 6 篇 dominating induc...
  • 5 篇 shortest path
  • 5 篇 np-hardness
  • 4 篇 maximum flow
  • 4 篇 equivalence

机构

  • 13 篇 univ g dannunzio...
  • 7 篇 univ rostock ins...
  • 5 篇 indian inst tech...
  • 5 篇 univ rostock ins...
  • 5 篇 zhejiang normal ...
  • 4 篇 univ primorska u...
  • 4 篇 indian inst tech...
  • 4 篇 univ primorska u...
  • 3 篇 lanzhou univ sch...
  • 3 篇 univ debrecen in...
  • 3 篇 simon fraser uni...
  • 3 篇 jaist sch inform...
  • 3 篇 kyushu int univ ...
  • 3 篇 kyushu univ dept...
  • 3 篇 univ victoria de...
  • 3 篇 univ warwick war...
  • 3 篇 hiroshima city u...
  • 3 篇 xinjiang univ co...
  • 2 篇 univ calif berke...
  • 2 篇 w virginia univ ...

作者

  • 15 篇 mosca raffaele
  • 12 篇 brandstaedt andr...
  • 9 篇 pradhan d.
  • 8 篇 akbalik ayse
  • 6 篇 rapine christoph...
  • 6 篇 uehara ryuhei
  • 6 篇 milanic martin
  • 6 篇 panda b. s.
  • 6 篇 woeginger gj
  • 5 篇 zhang zhao
  • 5 篇 saitoh toshiki
  • 5 篇 banerjee s.
  • 5 篇 shoudai takayosh...
  • 4 篇 suzuki yusuke
  • 4 篇 frosini a.
  • 4 篇 huang jing
  • 4 篇 kiyomi masashi
  • 4 篇 penz bernard
  • 4 篇 uchida tomoyuki
  • 4 篇 jarray fethi

语言

  • 250 篇 英文
  • 31 篇 其他
检索条件"主题词=polynomial time algorithm"
282 条 记 录,以下是111-120 订阅
Burning a graph is hard
收藏 引用
DISCRETE APPLIED MATHEMATICS 2017年 232卷 73-87页
作者: Bessy, Stephane Bonato, Anthony Janssen, Jeannette Rautenbach, Dieter Roshanbin, Elham LIRMM Montpellier France Ryerson Univ Dept Math Toronto ON M5B 2K3 Canada Dalhousie Univ Dept Math & Stat Halifax NS B3H 3J5 Canada Ulm Univ Inst Optimizat & Operat Res Ulm Germany
Graph burning is a model for the spread of social contagion. The burning number is a graph parameter associated with graph burning that measures the speed of the spread of contagion in a graph;the lower the burning nu... 详细信息
来源: 评论
A Batching Machine Model for Lot Scheduling on a Single Machine
收藏 引用
FOUNDATIONS OF COMPUTING AND DECISION SCIENCES 2018年 第1期43卷 37-40页
作者: Kovalyov, Mikhail Y. Natl Acad Sci Belarus United Inst Informat Problems Surganova 6 Minsk 220012 BELARUS
A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the order... 详细信息
来源: 评论
A Greedy algorithm for Reconstructing Binary Matrices with Adjacent 1s  18th
收藏 引用
18th International Workshop on Combinatorial Image Analysis (IWCIA)
作者: Jarray, Fethi Tlig, Ghassen Cedric CNAM 292 Rue St Martin Paris France Higher Inst Comp Sci Medenine Medenine Tunisia Higher Inst Comp Sci Tunis LIMTIC Tunis Tunisia
This paper deals with the reconstruction of special cases of binary matrices with adjacent 1s. Each element is horizontally adjacent to at least another element. The projections are the number of elements on each row ... 详细信息
来源: 评论
Low Complexity Node Clustering in Cloud-RAN for Service Provisioning and Resource Allocation
Low Complexity Node Clustering in Cloud-RAN for Service Prov...
收藏 引用
IEEE Global Telecommunications Conference (GLOBECOM)
作者: Wang, Haining Shetty, Priyesh Ding, Zhi Univ Calif Davis Dept Elect & Comp Engn Davis CA 95616 USA
Auction-based service provisioning and resource allocation have demonstrated strong potential in Cloud-RAN wireless network architecture and heterogeneous networks for effective resource sharing. One major technical c... 详细信息
来源: 评论
A polynomial time algorithm for Undirected Graph Isomorphism
A Polynomial Time Algorithm for Undirected Graph Isomorphism
收藏 引用
2011 World Congress on Engineering and Technology(CET 2011)
作者: Aimin Hou Zhifeng Hao School of Computer Science and Engineering South China University of Technology Guangzhou,China
Graph isomorphism is an important problem in graph theory.A popular class of testing methods uses necessary conditions to refine the vertex partition iteratively with ***,these known algorithms need many more backtrac... 详细信息
来源: 评论
algorithm for constraint partial inverse matroid problem with weight increase forbidden
收藏 引用
THEORETICAL COMPUTER SCIENCE 2016年 640卷 119-124页
作者: Li, Shuangshuang Zhang, Zhao Lai, Hong-Jian Xinjiang Univ Coll Math & Syst Sci Urumqi 830046 Xinjiang Peoples R China Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Zhejiang Peoples R China W Virginia Univ Dept Math Morgantown WV 26506 USA
In a partial inverse matroid problem, given a matroid M = (S, I), a real valued weight function w on S, and an independent set I-0 is an element of I, the goal is to modify the weight w as small as possible to a new w... 详细信息
来源: 评论
The complexity of the equation solvability problem over semipattern groups
收藏 引用
INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION 2017年 第2期27卷 259-272页
作者: Foldvari, Attila Univ Debrecen Inst Math Pf 400 H-4002 Debrecen Hungary
The complexity of the equation solvability problem is known for nilpotent groups, for not solvable groups and for some semidirect products of Abelian groups. We provide a new polynomial time algorithm for deciding the... 详细信息
来源: 评论
WEIGHTED EFFICIENT DOMINATION FOR P5-FREE AND P6-FREE GRAPHS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2016年 第4期30卷 2288-2303页
作者: Brandstaedt, Andreas Mosca, Raffaele Univ Rostock Inst Informat D-18051 Rostock Germany Univ G DAnnunzio Dipartimento Econ I-65121 Pescara Italy
In a finite undirected graph G = (V, E), a vertex v is an element of V dominates itself and its neighbors in G. A vertex set D subset of V is an efficient dominating set (e.d.s. for short) of G if every v 2 V is domin... 详细信息
来源: 评论
Improved algorithms for joint optimization of facility locations and network connections
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2016年 第3期250卷 745-753页
作者: Lai, Xiaofan Xu, Zhou Hong Kong Polytech Univ Fac Business Dept Logist & Maritime Studies Kowloon Hong Kong Peoples R China
This paper studies a k-median Steiner forest problem that jointly optimizes the opening of at most k facility locations and their connections to the client locations, so that each client is connected by a path to an o... 详细信息
来源: 评论
STATISTICAL AND COMPUTATIONAL TRADE-OFFS IN ESTIMATION OF SPARSE PRINCIPAL COMPONENTS
收藏 引用
ANNALS OF STATISTICS 2016年 第5期44卷 1896-1930页
作者: Wang, Tengyao Berthet, Quentin Samworth, Richard J. Stat Lab Wilberforce Rd Cambridge CB3 0WB England CALTECH Pasadena CA 91125 USA
extremely popular dimension reduction technique for high-dimensional data. The theoretical challenge, in the simplest case, is to estimate the leading eigenvector of a population covariance matrix under the assumption... 详细信息
来源: 评论