咨询与建议

限定检索结果

文献类型

  • 22,790 篇 会议
  • 9,099 篇 期刊文献
  • 64 篇 学位论文
  • 1 册 图书

馆藏范围

  • 31,954 篇 电子文献
  • 1 种 纸本馆藏

日期分布

学科分类号

  • 15,992 篇 工学
    • 10,028 篇 计算机科学与技术...
    • 4,940 篇 电气工程
    • 3,094 篇 软件工程
    • 2,702 篇 信息与通信工程
    • 1,956 篇 控制科学与工程
    • 737 篇 机械工程
    • 676 篇 电子科学与技术(可...
    • 625 篇 航空宇航科学与技...
    • 526 篇 仪器科学与技术
    • 228 篇 交通运输工程
    • 213 篇 材料科学与工程(可...
    • 203 篇 化学工程与技术
    • 169 篇 生物工程
    • 148 篇 测绘科学与技术
    • 138 篇 生物医学工程(可授...
    • 134 篇 动力工程及工程热...
    • 129 篇 土木工程
  • 10,371 篇 理学
    • 9,283 篇 数学
    • 909 篇 物理学
    • 766 篇 系统科学
    • 731 篇 统计学(可授理学、...
    • 261 篇 生物学
    • 245 篇 化学
    • 124 篇 地球物理学
  • 2,464 篇 管理学
    • 1,911 篇 管理科学与工程(可...
    • 669 篇 工商管理
    • 551 篇 图书情报与档案管...
  • 412 篇 经济学
    • 383 篇 应用经济学
  • 202 篇 医学
    • 170 篇 临床医学
  • 168 篇 法学
    • 166 篇 社会学
  • 130 篇 文学
  • 127 篇 农学
  • 36 篇 教育学
  • 27 篇 军事学
  • 11 篇 艺术学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 31,954 篇 approximation al...
  • 2,771 篇 algorithm design...
  • 2,328 篇 optimization
  • 2,318 篇 approximation me...
  • 2,158 篇 heuristic algori...
  • 1,414 篇 convergence
  • 1,411 篇 linear programmi...
  • 1,267 篇 computational mo...
  • 1,210 篇 resource managem...
  • 1,158 篇 signal processin...
  • 957 篇 computer science
  • 916 篇 polynomials
  • 910 篇 clustering algor...
  • 906 篇 complexity theor...
  • 786 篇 mathematical mod...
  • 750 篇 vectors
  • 720 篇 programming
  • 642 篇 estimation
  • 616 篇 training
  • 607 篇 transportation

机构

  • 97 篇 univ maryland de...
  • 69 篇 technion israel ...
  • 56 篇 univ waterloo de...
  • 54 篇 cornell univ dep...
  • 42 篇 tsinghua univers...
  • 39 篇 national institu...
  • 39 篇 iit dept comp sc...
  • 39 篇 carnegie mellon ...
  • 35 篇 national mobile ...
  • 34 篇 shandong univ sc...
  • 33 篇 nanjing univ sta...
  • 32 篇 sichuan univ col...
  • 31 篇 school of comput...
  • 31 篇 max planck inst ...
  • 31 篇 swiss fed inst t...
  • 30 篇 univ chinese aca...
  • 30 篇 mit cambridge ma...
  • 29 篇 technion haifa
  • 29 篇 suny stony brook...
  • 28 篇 tel aviv univers...

作者

  • 64 篇 woodruff david p...
  • 64 篇 ravi r.
  • 53 篇 kortsarz guy
  • 43 篇 lee euiwoong
  • 43 篇 levin asaf
  • 41 篇 chan timothy m.
  • 37 篇 chen zhi-zhong
  • 36 篇 friggstad zachar...
  • 36 篇 kumar amit
  • 33 篇 kawarabayashi ke...
  • 32 篇 manurangsi pasin
  • 32 篇 chalermsook pari...
  • 31 篇 wang lusheng
  • 30 篇 zenklusen rico
  • 29 篇 thai my t.
  • 29 篇 williamson david...
  • 29 篇 carmi paz
  • 29 篇 gudmundsson joac...
  • 28 篇 saha barna
  • 28 篇 shmoys david b.

语言

  • 31,265 篇 英文
  • 550 篇 其他
  • 114 篇 中文
  • 9 篇 日文
  • 7 篇 俄文
  • 4 篇 法文
  • 3 篇 德文
  • 2 篇 西班牙文
  • 1 篇 葡萄牙文
  • 1 篇 土耳其文
检索条件"主题词=approximation algorithms"
31954 条 记 录,以下是131-140 订阅
排序:
approximation algorithms for scheduling problems with a modified total weighted tardiness objective
收藏 引用
OPERATIONS RESEARCH LETTERS 2007年 第5期35卷 685-692页
作者: Kolliopoulos, Stavros G. Steiner, George Univ Athens Dept Informat & Telecommun Athens Greece McMaster Univ Hamilton ON L8S 4L8 Canada
We study the approximability of minimum total weighted tardiness with a modified objective which includes an additive constant. This ensures the existence of a positive lower bound for the minimum value. Moreover the ... 详细信息
来源: 评论
approximation algorithms for Max Morse Matching
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 2017年 61卷 1-23页
作者: Rathod, Abhishek Bin Masood, Talha Natarajan, Vijay Indian Inst Sci Dept Comp Sci & Automat Bangalore Karnataka India
In this paper, we prove that the Max Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch [1]. For D-dimensional simplicial complexes, we obtain a (D+1)/(D-2+D+1)-factor a... 详细信息
来源: 评论
approximation algorithms for pricing with negative network externalities
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2017年 第2期33卷 681-712页
作者: Cao, Zhigang Chen, Xujin Hu, Xiaodong Wang, Changjun Chinese Acad Sci Acad Math & Syst Sci Beijing 100190 Peoples R China Beijing Univ Technol Beijing Inst Sci & Engn Comp Beijing 100124 Peoples R China
We study the problems of pricing an indivisible product to consumers who are embedded in a given social network. The goal is to maximize the revenue of the seller by the so-called iterative pricing that offers consume... 详细信息
来源: 评论
approximation algorithms for inventory problems with submodular or routing costs
收藏 引用
MATHEMATICAL PROGRAMMING 2016年 第1-2期160卷 225-244页
作者: Nagarajan, Viswanath Shi, Cong Univ Michigan Ind & Operat Engn Ann Arbor MI 48109 USA
We consider the following two deterministic inventory optimization problems with non-stationary demands. Submodular joint replenishment problem. This involves multiple item types and a single retailer who faces demand... 详细信息
来源: 评论
approximation algorithms on k-Cycle Transversal and k-Clique Transversal
收藏 引用
Journal of the Operations Research Society of China 2021年 第4期9卷 883-892页
作者: Zhong-Zheng Tang Zhuo Diao School of Science Beijing University of Posts and TelecommunicationsBeijing 100876China School of Statistics and Mathematics Central University of Finance and EconomicsBeijing 100081China
Given a weighted graph G=(V,E)with weight w:E→Z+,a k-cycle transversal is an edge subset A of E such that G−A has no *** minimum weight of kcycle transversal is the weighted transversal number on k-cycle,denoted byτ... 详细信息
来源: 评论
approximation algorithms AND HARDNESS FOR DOMINATION WITH PROPAGATION
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2009年 第3期23卷 1382-1399页
作者: Aazami, Ashkan Stilp, Kael Univ Waterloo Dept Combinator & Optimizat Waterloo ON N2L 3G1 Canada Georgia Inst Technol Sch Ind & Syst Engn Atlanta GA 30332 USA
The POWER DOMINATING SET (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes S that power dominates all the nodes, where a node v is power dominated if ... 详细信息
来源: 评论
approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem
收藏 引用
JOURNAL OF GLOBAL OPTIMIZATION 2024年 第4期90卷 965-982页
作者: Pan, Pengxiang Lichen, Junran Li, Jianping Yunnan Univ Sch Math & Stat East Outer Ring South Rd Kunming 650504 Peoples R China Beijing Univ Chem Technol Sch Math & Phys North Third Ring East Rd Beijing 100029 Peoples R China
In this paper, we address the vertex-traversing-constrained mixed Chinese postman problem (the VtcMCP problem), which is a further generalization of the Chinese postman problem, and this new problem has many practical... 详细信息
来源: 评论
approximation algorithms for sorting by k-cuts on signed permutations
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年 第1期45卷 1-30页
作者: Oliveira, Andre Rodrigues Alexandrino, Alexsandro Oliveira Jean, Geraldine Fertin, Guillaume Dias, Ulisses Dias, Zanoni Univ Estadual Campinas Inst Comp Campinas SP Brazil Nantes Univ UMR LS2N CNRS F-6004 Nantes France Univ Estadual Campinas Sch Technol Limeira Brazil
Sorting by Genome Rearrangements is a classic problem in Computational Biology. Several models have been considered so far, each of them defines how a genome is modeled (for example, permutations when assuming no dupl... 详细信息
来源: 评论
approximation algorithms for solving the trip-constrained vehicle routing cover problems
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2024年 第3期48卷 1-24页
作者: Li, Jianping Yang, Ping Lichen, Junran Pan, Pengxiang Yunnan Univ Univ Town Sch Math & Stat East Outer Ring South Rd Kunming 650504 Peoples R China Beijing Univ Chem Technol Sch Math & Phys North Third Ring East Rd Beijing 100029 Peoples R China
In this paper, we address the trip-constrained vehicle routing cover problem (theTcVRC problem). Specifically, given a metric complete graphG=(V,E;w)with a set D(subset of V)of depots, a setJ(=V\D)of customer location... 详细信息
来源: 评论
approximation algorithms for decomposing octilinear polygons
收藏 引用
THEORETICAL COMPUTER SCIENCE 2019年 779卷 17-36页
作者: Cicerone, Serafino Di Stefano, Gabriele Univ Aquila Dept Informat Engn Comp Sci & Math Via Vetoio I-67100 Laquila Italy
We study the minimal decomposition of octilinear polygons with holes into octilinear triangles and rectangles. This new problem is relevant in the context of modern electronic CAD systems, where the generation and pro... 详细信息
来源: 评论