咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是171-180 订阅
排序:
approximation algorithms for the unsplittable flow problem
收藏 引用
ALGORITHMICA 2007年 第1期47卷 53-78页
作者: Chakrabarti, Amit Chekuri, Chandra Gupta, Anupam Kumar, Amit Dartmouth Coll Dept Comp Sci Hanover NH 03755 USA Lucent Bell Labs Murray Hill NJ 07974 USA Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA Indian Inst Technol Dept Comp Sci New Delhi 110016 India Princeton Univ Princeton NJ 08544 USA Cornell Univ Ithaca NY 14853 USA
We present approximation algorithms for the unsplittable flow problem (UFP) in undirected graphs. As is standard in this line of research, we assume that the maximum demand is at most the minimum Capacity. We focus on... 详细信息
来源: 评论
approximation algorithms for shop scheduling problems with minsum objective (vol 5, pg 287, 2002)
收藏 引用
JOURNAL OF SCHEDULING 2006年 第6期9卷 569-570页
作者: Li, Wenhua Queyranne, Maurice Sviridenko, Maxim Yuan, Jinjiang Zhengzhou Univ Dept Math Zhengzhou 450052 Henan Peoples R China Univ British Columbia Sauder Sch Business Vancouver BC V6T 1Z2 Canada IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA
We present a correction to the paper, "approximation algorithms for shop scheduling problems with minsum objective" (Journal of Scheduling 2002;5:287-305) by Queyranne and Sviridenko. This correction provide... 详细信息
来源: 评论
approximation algorithms for clique transversals on some graph classes
收藏 引用
INFORMATION PROCESSING LETTERS 2015年 第9期115卷 667-670页
作者: Lin, Min Chih Vasiliev, Saveliy Univ Buenos Aires CONICET RA-1053 Buenos Aires DF Argentina Univ Buenos Aires FCEyN Inst Calculo RA-1053 Buenos Aires DF Argentina
Given a graph G = (V. E) a clique is a maximal subset of pairwise adjacent vertices of V of size at least 2. A clique transversal is a subset of vertices that intersects the vertex set of each clique of G. Finding a m... 详细信息
来源: 评论
approximation algorithms for the covering-type k-violation linear program
收藏 引用
OPTIMIZATION LETTERS 2019年 第7期13卷 1515-1521页
作者: Takazawa, Yotaro Mizuno, Shinji Kitahara, Tomonari Tokyo Inst Technol Dept Ind Engn & Econ Meguro Ku 2-12-1 Ohokayama Tokyo 1528552 Japan
We study the covering-type k-violation linear program where at most k of the constraints can be violated. This problem is formulated as a mixed integer program and known to be strongly NP-hard. In this paper, we prese... 详细信息
来源: 评论
approximation algorithms for solving the heterogeneous Chinese postman problem
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2023年 第1期45卷 1-15页
作者: Li, Jianping Pan, Pengxiang Lichen, Junran Cai, Lijian Wang, Wencheng Liu, Suding Yunnan Univ Sch Math & Stat East Outer Ring South Rd Kunming 650504 Yunnan Peoples R China Beijing Univ Chem Technol Sch Math & Phys 15 North Third Ring East Rd Beijing 100029 Peoples R China
In this paper, we consider the heterogeneous Chinese postman problem (the HCPP), which generalizes the k-Chinese postman problem. Specifically, given a weighted graph G = (V, E;w;r) with length function w : E -> R+... 详细信息
来源: 评论
approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2014年 第3期234卷 641-649页
作者: Massonnet, G. Gayon, J. -P. Rapine, C. Grenoble INP UJF Grenoble 1 CNRS G SCOP UMR5272 F-38031 Grenoble France Univ Lorraine Lab LGIPM F-57045 Metz 1 France
This work deals with the continuous time lot-sizing inventory problem when demand and costs are time-dependent. We adapt a cost balancing technique developed for the periodic-review version of our problem to the conti... 详细信息
来源: 评论
approximation algorithms FOR BICLUSTERING PROBLEMS
收藏 引用
SIAM JOURNAL ON COMPUTING 2008年 第4期38卷 1504-1518页
作者: Wang, Lusheng Lin, Yu Liu, Xiaowen City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Chinese Acad Sci Inst Comp Technol Beijing Peoples R China
One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) that exhibit similar expression patterns... 详细信息
来源: 评论
approximation algorithms for Constructing Steiner Trees in the Euclidean Plane R^(2)Using Stock Pieces of Materials with Fixed Length
收藏 引用
Journal of the Operations Research Society of China 2024年 第4期12卷 996-1021页
作者: Jian-Ping Li Wen-Cheng Wang Jun-Ran Lichen Yu-Jie Zheng Department of Mathematics Yunnan UniversityKunming650504YunnanChina School of Mathematics and Physics Beijing University of Chemical TechnologyBeijing100029China
In this paper,we address the problem of constructing a Steiner tree in the Euclidean plane R^(2)using stock pieces of materials with fixed length,which is modelled as *** a set X={r_(1),r_(2)…,r_(n)}of n terminals in... 详细信息
来源: 评论
approximation algorithms for the ring loading problem with penalty cost
收藏 引用
INFORMATION PROCESSING LETTERS 2014年 第1-2期114卷 56-59页
作者: Li, Weidong Li, Jianping Guan, Li Yunnan Univ Kunming 650091 Peoples R China
The ring loading problem and its variants have been extensively studied in the last fifteen years, under the assumption that all requests have to be satisfied. However, in many practical cases, one may wish to reject ... 详细信息
来源: 评论
approximation algorithms FOR DATA PLACEMENT PROBLEMS
收藏 引用
SIAM JOURNAL ON COMPUTING 2008年 第4期38卷 1411-1429页
作者: Baev, Ivan Rajaraman, Rajmohan Swamy, Chaitanya Hewlett Packard Corp Java Compilers & Tools Lab Cupertino CA 95014 USA Northeastern Univ Coll Comp Sci Boston MA 02115 USA Univ Waterloo Waterloo ON N2L 3G1 Canada
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity for storing data objects so as to minimi... 详细信息
来源: 评论