咨询与建议

限定检索结果

文献类型

  • 312 篇 期刊文献
  • 68 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

  • 381 篇 polynomial-time ...
  • 37 篇 computational co...
  • 23 篇 np-completeness
  • 17 篇 np-hardness
  • 17 篇 scheduling
  • 16 篇 np-hard
  • 12 篇 np-complete
  • 12 篇 dynamic programm...
  • 11 篇 graph theory
  • 9 篇 np-hard problem
  • 9 篇 linear programmi...
  • 9 篇 independent set
  • 9 篇 combinatorial op...
  • 8 篇 approximation al...
  • 8 篇 stable matching
  • 7 篇 discrete tomogra...
  • 7 篇 matching
  • 6 篇 network
  • 6 篇 complexity
  • 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...

语言

  • 326 篇 英文
  • 52 篇 其他
  • 1 篇 土耳其文
  • 1 篇 中文
检索条件"主题词=polynomial-time algorithm"
381 条 记 录,以下是111-120 订阅
排序:
Counting 3-stack-sortable permutations
收藏 引用
JOURNAL OF COMBINATORIAL THEORY SERIES A 2020年 172卷
作者: Defant, Colin Princeton Univ Fine Hall304 Washington Rd Princeton NJ 08544 USA
We prove a "decomposition lemma" that allows us to count preimages of certain sets of permutations under West's stacksorting map s. As a first application, we give a new proof of Zeilberger's formula... 详细信息
来源: 评论
Mind the independence gap
收藏 引用
DISCRETE MATHEMATICS 2020年 第9期343卷
作者: Ekim, Tinaz Gozupek, Didem Hujdurovic, Ademir Milanic, Martin Bogazici Univ Dept Ind Engn Istanbul Turkey Gebze Tech Univ Dept Comp Engn Kocaeli Turkey Univ Primorska UP IAM Muzejski Trg 2 SI-6000 Koper Slovenia Univ Primorska UP FAMNIT Glagoljaska 8 SI-6000 Koper Slovenia
The independence gap of a graph was introduced by Ekim et al. in 2018 as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal indep... 详细信息
来源: 评论
Wasserstein barycenters can be computed in polynomial time in fixed dimension
The Journal of Machine Learning Research
收藏 引用
The Journal of Machine Learning Research 2021年 第1期22卷 2000-2018页
作者: Jason M. Altschuler Enric Boix-Adserà Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge MA
Computing Wasserstein barycenters is a fundamental geometric problem with widespread applications in machine learning, statistics, and computer graphics. However, it is unknown whether Wasserstein barycenters can be c... 详细信息
来源: 评论
Wasserstein Barycenters can be Computed in polynomial time in Fixed Dimension
收藏 引用
JOURNAL OF MACHINE LEARNING RESEARCH 2021年 22卷
作者: Altschuler, Jason M. Boix-Adsera, Enric MIT Lab Informat & Decis Syst 77 Massachusetts Ave Cambridge MA 02139 USA
Computing Wasserstein barycenters is a fundamental geometric problem with widespread applications in machine learning, statistics, and computer graphics. However, it is unknown whether Wasserstein barycenters can be c... 详细信息
来源: 评论
An improved algorithm for single-unit commitment with ramping limits
收藏 引用
ELECTRIC POWER SYSTEMS RESEARCH 2021年 190卷
作者: Wuijts, Rogier Hans van den Akker, Marjan van den Broek, Machteld Univ Utrecht Dept Informat & Comp Sci Utrecht Netherlands Univ Utrecht Copernicus Inst Sustainable Dev Utrecht Netherlands Univ Groningen Energy Res Inst Groningen ESRIG Integrated Res Energy Environm & Soc IREES Groningen Netherlands
The single-unit commitment problem (1UC) is the problem of finding a cost optimal schedule for a single generator given a time series of electricity prices subject to generation limits, minimum upand downtime and ramp... 详细信息
来源: 评论
A diameter-based model of the rectilinear partitioning problem in VLSI physical design
A diameter-based model of the rectilinear partitioning probl...
收藏 引用
Chinese Automation Congress (CAC)
作者: Lin, Lan Wu, Tong Zhang, Zhifeng Tongji Univ Dept Elect Sci & Technol Shanghai Peoples R China
The rectilinear point-partitioning problem in VLSI physical design can be stated as follows: Given n points in the plane and a number p with 1 <= p < n/2, find p disjoint axis-parallel rectangles R-1, R-2, ..., ... 详细信息
来源: 评论
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles  21st
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint...
收藏 引用
21st International Conference on Integer Programming and Combinatorial Optimization (IPCO)
作者: Kobayashi, Yusuke Kyoto Univ Res Inst Math Sci Kyoto 6068502 Japan
The weighted T-free 2-matching problem is the following problem: given an undirected graph G, a weight function on its edge set, and a set T of triangles in G, find a maximum weight 2-matching containing no triangle i... 详细信息
来源: 评论
Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
收藏 引用
algorithmS 2021年 第4期14卷
作者: Schaller, David Geiss, Manuela Hellmuth, Marc Stadler, Peter F. Max Planck Inst Math Sci D-04103 Leipzig Germany Univ Leipzig Bioinformat Grp Dept Comp Sci D-04107 Leipzig Germany Univ Leipzig Interdisciplinary Ctr Bioinformat D-04107 Leipzig Germany Software Competence Ctr Hagenberg GmbH SCCH A-4232 Hagenberg Austria Stockholm Univ Fac Sci Dept Math SE-10691 Stockholm Sweden Univ Leipzig Competence Ctr Scalable Data Serv & Solut Leipzig Res Ctr Civilizat Dis Res iDiv Halle Jena LeipzigGerman Ctr Integrat B D-04103 Leipzig Germany Univ Leipzig Leipzig Res Ctr Civilizat Dis LIFE D-04103 Leipzig Germany Univ Vienna Inst Theoret Chem A-1090 Vienna Austria Univ Nacl Colombia Fac Ciencias CO-111321 Bogota Colombia Santa Fe Inst Santa Fe NM 87501 USA
Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are expl... 详细信息
来源: 评论
New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
收藏 引用
THEORETICAL COMPUTER SCIENCE 2019年 795卷 128-141页
作者: Chiarelli, Nina Romina Hartinger, Tatiana Alejandra Leoni, Valeria Lopez Pujato, Maria Ines Milanic, Martin Univ Primorska Fac Math Nat Sci & Informat Technol Glagoljaska 8 SI-6000 Koper Slovenia Univ Primorska Andrej Marusic Inst Muzejski Trg 2 SI-6000 Koper Slovenia Cognit Etermax Labs Estados Unidos 34Piso 7C11001AAB Buenos Aires DF Argentina Univ Nacl Rosario FCEIA Rosario Santa Fe Argentina Consejo Nacl Invest Cient & Tecn Buenos Aires DF Argentina ANPCyT Buenos Aires DF Argentina
Given a positive integer k, a k-dominating set in a graph G is a set of vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set is a set of vertices such that every... 详细信息
来源: 评论
When Can Graph Hyperbolicity be Computed in Linear time?
收藏 引用
algorithmICA 2019年 第5期81卷 2016-2045页
作者: Fluschnik, Till Komusiewicz, Christian Mertzios, George B. Nichterlein, Andre Niedermeier, Rolf Talmon, Nimrod TU Berlin Fak 4 Algorithm & Computat Complex Berlin Germany Philipps Univ Marburg Fachbereich Math & Informat Marburg Germany Univ Durham Dept Comp Sci Durham England Ben Gurion Univ Negev Beer Sheva Israel
Hyperbolicity is a distance-based measure of how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunate... 详细信息
来源: 评论