咨询与建议

限定检索结果

文献类型

  • 311 篇 期刊文献
  • 68 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 235 篇 理学
    • 232 篇 数学
    • 4 篇 生物学
    • 4 篇 统计学(可授理学、...
    • 2 篇 物理学
  • 232 篇 工学
    • 191 篇 计算机科学与技术...
    • 38 篇 软件工程
    • 33 篇 电气工程
    • 17 篇 信息与通信工程
    • 8 篇 控制科学与工程
    • 6 篇 机械工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 土木工程
    • 4 篇 交通运输工程
    • 2 篇 动力工程及工程热...
    • 1 篇 力学(可授工学、理...
    • 1 篇 仪器科学与技术
    • 1 篇 化学工程与技术
    • 1 篇 石油与天然气工程
    • 1 篇 生物工程
  • 96 篇 管理学
    • 96 篇 管理科学与工程(可...
    • 17 篇 工商管理
    • 1 篇 图书情报与档案管...
  • 21 篇 经济学
    • 17 篇 应用经济学
    • 5 篇 理论经济学
  • 2 篇 法学
    • 2 篇 法学
  • 1 篇 哲学
    • 1 篇 哲学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 381 篇 polynomial-time ...
  • 36 篇 computational co...
  • 23 篇 np-completeness
  • 17 篇 np-hardness
  • 16 篇 np-hard
  • 16 篇 scheduling
  • 12 篇 np-complete
  • 11 篇 dynamic programm...
  • 10 篇 linear programmi...
  • 10 篇 graph theory
  • 9 篇 np-hard problem
  • 9 篇 independent set
  • 9 篇 combinatorial op...
  • 8 篇 approximation al...
  • 8 篇 stable matching
  • 7 篇 discrete tomogra...
  • 7 篇 matching
  • 7 篇 complexity
  • 6 篇 network
  • 5 篇 temporal graph

机构

  • 16 篇 univ warwick mat...
  • 15 篇 univ warwick dim...
  • 7 篇 rutgers state un...
  • 7 篇 univ durham dept...
  • 6 篇 univ glasgow dep...
  • 6 篇 hong kong polyte...
  • 6 篇 univ rostock ins...
  • 5 篇 natl res univ hi...
  • 4 篇 zhengzhou univ s...
  • 4 篇 univ g dannunzio...
  • 4 篇 kwansei gakuin u...
  • 4 篇 natl res univ hi...
  • 3 篇 univ ioannina de...
  • 3 篇 univ glasgow sch...
  • 3 篇 univ primorska u...
  • 3 篇 kyoto univ grad ...
  • 3 篇 russian acad sci...
  • 3 篇 ben gurion univ ...
  • 3 篇 univ wisconsin d...
  • 3 篇 univ wisconsin w...

作者

  • 15 篇 milanic martin
  • 13 篇 lozin vadim
  • 11 篇 lozin vadim v.
  • 10 篇 manlove david f.
  • 10 篇 malyshev d. s.
  • 10 篇 miwa hiroyoshi
  • 9 篇 mosca raffaele
  • 7 篇 paulusma daniel
  • 7 篇 brandstaedt andr...
  • 7 篇 kobayashi yusuke
  • 6 篇 mertzios george ...
  • 6 篇 ries bernard
  • 5 篇 purcell christop...
  • 5 篇 van iersel leo
  • 4 篇 lin lan
  • 4 篇 gritzmann p
  • 4 篇 maeda nao
  • 4 篇 golovach petr a.
  • 4 篇 del pia alberto
  • 4 篇 papadopoulos cha...

语言

  • 328 篇 英文
  • 51 篇 其他
  • 1 篇 土耳其文
  • 1 篇 中文
检索条件"主题词=Polynomial-time algorithm"
381 条 记 录,以下是261-270 订阅
排序:
Matching problems with delta-matroid constraints  12
Matching problems with delta-matroid constraints
收藏 引用
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
作者: Naonori Kakimura Mizuyo Takamatsu University of Tokyo Tokyo Japan Chuo University Tokyo Japan
Given an undirected graph G = (V, E) and a directed graph D = (V, A), the master/slave matching problem is to find a matching of maximum cardinality in G such that for each arc (u, v) ε A with u being matched, v is a... 详细信息
来源: 评论
polynomial-time Feasibility Condition for Multiclass Aircraft Sequencing on a Single-Runway Airport
收藏 引用
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2011年 第1期12卷 2-14页
作者: Harikiopoulo, Dimitri Neogi, Natasha Univ Illinois Dept Aeronaut & Aerosp Urbana IL 61801 USA
In this paper, we consider the airport-landing problem of scheduling different types of aircraft on a single runway. Since the minimum allowable landing separation time between two consecutive aircraft depends on the ... 详细信息
来源: 评论
On the complexity of the dominating induced matching problem in hereditary classes of graphs
收藏 引用
DISCRETE APPLIED MATHEMATICS 2011年 第7期159卷 521-531页
作者: Cardoso, Domingos M. Korpelainen, Nicholas Lozin, Vadim V. Univ Warwick DIMAP Coventry CV4 7AL W Midlands England Univ Warwick Math Inst Coventry CV4 7AL W Midlands England Univ Aveiro Dept Matemat P-3810193 Aveiro Portugal
The DOMINATING INDUCED MATCHING problem, also known as EFFICIENT EDGE DOMINATION, is the problem of determining whether a graph has an induced matching that dominates every edge of the graph. This problem is known to ... 详细信息
来源: 评论
Constructing the Simplest Possible Phylogenetic Network from Triplets
收藏 引用
algorithmICA 2011年 第2期60卷 207-235页
作者: van Iersel, Leo Kelk, Steven Univ Canterbury Dept Math & Stat Christchurch 1 New Zealand CWI NL-1090 GB Amsterdam Netherlands
A phylogenetic network is a directed acyclic graph that visualizes an evolutionary history containing so-called reticulations such as recombinations, hybridizations or lateral gene transfers. Here we consider the cons... 详细信息
来源: 评论
On the asymptotic optimality of an algorithm for solving the maximum m-PSP in a multidimensional Euclidean space
收藏 引用
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS 2011年 第1-Sup期272卷 1-13页
作者: Baburin, A. E. Gimadi, E. Kh Russian Acad Sci Sobolev Inst Math Siberian Branch Novosibirsk 630090 Russia
An efficient algorithm A with a guaranteed error estimate is presented for solving the problem of finding several edge-disjoint Hamiltonian circuits (traveling salesman tours) of maximum weight in a complete weighted ... 详细信息
来源: 评论
polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
收藏 引用
Electronic Notes in Discrete Mathematics 2010年 第C期36卷 647-654页
作者: Simonin, G. Giroudeau, R. König, J.-C. LIRMM UMR 5056 34392 Montpellier Cedex 5 161 rue Ada France
We consider the problem to schedule n coupled-tasks in presence of treatment tasks. This work is motivated by the problem of data acquisition for a torpedo. In such context, we developp a O(nlog(n)) polynomial-time al... 详细信息
来源: 评论
Cooperative project scheduling with controllable processing times: a game theory framework
Cooperative project scheduling with controllable processing ...
收藏 引用
16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)
作者: Briand, Cyril Billaut, Jean-Charles Univ Toulouse LAAS CNRS F-31077 Toulouse 4 France
This paper considers a project-scheduling environment assuming that the activities of the project network are distributed among a set of actors (or agents). Activity durations are modeled as time intervals and are con... 详细信息
来源: 评论
How to Play Unique Games against a Semi-Random Adversary Study of Semi-Random Models of Unique Games
How to Play Unique Games against a Semi-Random Adversary Stu...
收藏 引用
52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS)
作者: Kolla, Alexandra Makarychev, Konstantin Makarychev, Yury Microsoft Research United States IBM Research United States TTIC United States
In this paper, we study the average case complexity of the Unique Games problem. We propose a semi-random model, in which a unique game instance is generated in several steps. First an adversary selects a completely s... 详细信息
来源: 评论
Keeping partners together: algorithmic results for the hospitals/residents problem with couples
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2010年 第3期19卷 279-303页
作者: McDermid, Eric J. Manlove, David F. Univ Glasgow Dept Comp Sci Glasgow G12 8QQ Lanark Scotland
The Hospitals/Residents problem with Couples (HRC) is a generalisation of the classical Hospitals/Residents problem (HR) that is important in practical applications because it models the case where couples submit join... 详细信息
来源: 评论
A Fast algorithm for the Path 2-Packing Problem
收藏 引用
THEORY OF COMPUTING SYSTEMS 2010年 第1期46卷 59-79页
作者: Babenko, Maxim A. Moscow MV Lomonosov State Univ Dept Mech & Math Moscow 119991 Russia
Let G be an undirected graph and T = {T-1,..., T-k} be a collection of disjoint subsets of nodes. Nodes in T-1 boolean OR ... boolean OR T-k are called terminals, other nodes are called inner. By a T-path we mean a pa... 详细信息
来源: 评论