咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 283 篇 polynomial time ...
  • 21 篇 np-complete
  • 19 篇 computational co...
  • 17 篇 scheduling
  • 13 篇 approximation al...
  • 12 篇 domination
  • 12 篇 np-completeness
  • 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 篇 interval graphs
  • 5 篇 shortest path
  • 5 篇 np-hardness
  • 4 篇 maximum flow

机构

  • 13 篇 univ g dannunzio...
  • 7 篇 univ rostock ins...
  • 5 篇 indian inst tech...
  • 5 篇 indian inst tech...
  • 5 篇 univ rostock ins...
  • 5 篇 zhejiang normal ...
  • 4 篇 univ primorska u...
  • 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...
  • 10 篇 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

语言

  • 251 篇 英文
  • 32 篇 其他
检索条件"主题词=polynomial time algorithm"
283 条 记 录,以下是181-190 订阅
排序:
Scheduling in broadcast networks
收藏 引用
NETWORKS 1998年 第4期32卷 233-253页
作者: Hall, NG Liu, WP Sidney, JB Univ Ottawa Fac Adm Ottawa ON K1N 6N5 Canada Ohio State Univ Columbus OH 43210 USA
Broadcasting in a communications network has been the subject of many studies in recent years. The studies vary in their assumptions governing the behavior of the network and in their objectives with respect to the ne... 详细信息
来源: 评论
C-graph automatic groups
收藏 引用
JOURNAL OF ALGEBRA 2014年 413卷 289-319页
作者: Elder, Murray Taback, Jennifer Univ Newcastle Sch Math & Phys Sci Callaghan NSW 2308 Australia Bowdoin Coll Dept Math Brunswick ME 04011 USA
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov by replacing the regular languages in their definition with more powerful language classes. For a fixed langua... 详细信息
来源: 评论
Roll cutting in the curtain industry, or: A well-solvable allocation problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2007年 第3期183卷 1397-1404页
作者: Alfieri, Arianna van de Velde, Steef Woeginger, Gerhard J. Erasmus Univ RSM NL-3000 DR Rotterdam Netherlands Politecn Torino Dipartimento Sistemi Prod & Econ Azienda I-10129 Turin Italy Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands
We study the problem of cutting a number of pieces of the same length from n rolls of different lengths so that the remaining part of each utilized roll is either sufficiently short or sufficiently long. A piece is &#... 详细信息
来源: 评论
DECIDING POSITIVITY OF LITTLEWOOD-RICHARDSON COEFFICIENTS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2013年 第4期27卷 1639-1681页
作者: Buergisser, Peter Ikenmeyer, Christian Univ Paderborn Inst Math D-33098 Paderborn Germany
Starting with Knutson and Tao's hive model [J. Amer. Math. Soc., 12 (1999), pp. 1055-1090] we characterize the Littlewood-Richardson coefficient c(lambda)(nu),(mu) of given partitions lambda, mu, nu is an element ... 详细信息
来源: 评论
NEW GEOMETRIC REPRESENTATIONS AND DOMINATION PROBLEMS ON TOLERANCE AND MULTITOLERANCE GRAPHS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2016年 第3期30卷 1685-1725页
作者: Giannopoulou, Archontia C. Mertzios, George B. Tech Univ Berlin Inst Software Technol & Theoret Comp Sci D-10623 Berlin Germany Univ Durham Sch Engn & Comp Sci Durham DH1 County Durham England
Tolerance graphs model interval relations in such a way that intervals can tolerate a certain amount of overlap without being in conflict. In one of the most natural generalizations of tolerance graphs with direct app... 详细信息
来源: 评论
A class of inverse dominant problems under weighted l norm and an improved complexity bound for Radzik's algorithm
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2006年 第4期34卷 551-567页
作者: Wang, Q Yang, XG Zhang, JZ China Jiliang Univ Dept Math Hangzhou 310018 Peoples R China Chinese Acad Sci Inst Syst Sci Beijing 100080 Peoples R China City Univ Hong Kong Dept Math Hong Kong Hong Kong Peoples R China
In this paper, we first discuss a class of inverse dominant problems under weighted l(infinity) norm, which is how to change the original weights of elements with bounds in a finite ground set so that a given set beco... 详细信息
来源: 评论
Production Scheduling with History-Dependent Setup times
收藏 引用
NAVAL RESEARCH LOGISTICS 2012年 第1期59卷 58-68页
作者: Lee, Kangbok Lei, Lei Pinedo, Michael Rutgers State Univ Rutgers Business Sch Dept Supply Chain Management & Mkt Sci Newark NJ 07102 USA NYU Stern Sch Business Dept Informat Operat & Management Sci New York NY USA
We consider a parallel-machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred... 详细信息
来源: 评论
On the complexity of the identifiable subgraph problem, revisited
收藏 引用
DISCRETE APPLIED MATHEMATICS 2017年 226卷 78-86页
作者: Kratsch, Stefan Milanic, Martin Univ Bonn Inst Comp Sci Friedrich Ebert Allee 144 D-53113 Bonn Germany Univ Primorska UP IAM Muzejski Trg 2 SI-6000 Koper Slovenia Univ Primorska UP FAMNIT Glagoljaska 8 SI-6000 Koper Slovenia
A bipartite graph G = (L, R;E) with at least one edge is said to be identifiable if for every vertex v is an element of L, the subgraph induced by its non-neighbors has a matching of cardinality |L| - 1. An l-subgraph... 详细信息
来源: 评论
The k-th Roman domination problem is polynomial on interval graphs
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2024年 第3期48卷 1-14页
作者: Li, Peng Chongqing Univ Technol 69 Hongguang Rd Chongqing Peoples R China
Let G be some simple graph and k be any positive integer. Take h : V ( G )- {0,1, , ... ,k+1} and v is an element of V (G), let AN(h)(v) denote the set of vertices w is an element of N-G (v) with h (w) >= 1. Let AN... 详细信息
来源: 评论
algorithm and hardness results on neighborhood total domination in graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2020年 840卷 16-32页
作者: Jha, Anupriya Pradhan, D. Banerjee, S. Indian Inst Technol ISM Dhanbad Dept Math & Comp Dhanbad Bihar India
A set D subset of V of a graph G = (V, E) is called a neighborhood total dominating set of G if D is a dominating set and the subgraph of G induced by the open neighborhood of D has no isolated vertex. Given a graph G... 详细信息
来源: 评论