咨询与建议

限定检索结果

文献类型

  • 2,431 篇 期刊文献
  • 770 篇 会议
  • 24 篇 学位论文
  • 4 册 图书

馆藏范围

  • 3,229 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 2,348 篇 工学
    • 2,007 篇 计算机科学与技术...
    • 477 篇 电气工程
    • 380 篇 信息与通信工程
    • 337 篇 软件工程
    • 76 篇 机械工程
    • 74 篇 控制科学与工程
    • 68 篇 电子科学与技术(可...
    • 29 篇 交通运输工程
    • 28 篇 仪器科学与技术
    • 11 篇 材料科学与工程(可...
    • 8 篇 土木工程
    • 6 篇 力学(可授工学、理...
    • 6 篇 测绘科学与技术
    • 6 篇 石油与天然气工程
    • 6 篇 生物工程
    • 3 篇 环境科学与工程(可...
  • 1,652 篇 理学
    • 1,598 篇 数学
    • 28 篇 生物学
    • 25 篇 统计学(可授理学、...
    • 19 篇 物理学
    • 12 篇 系统科学
    • 10 篇 化学
    • 3 篇 地球物理学
  • 897 篇 管理学
    • 890 篇 管理科学与工程(可...
    • 235 篇 工商管理
    • 5 篇 图书情报与档案管...
  • 242 篇 经济学
    • 235 篇 应用经济学
    • 6 篇 理论经济学
  • 10 篇 法学
    • 8 篇 法学
  • 9 篇 医学
    • 5 篇 临床医学
  • 8 篇 军事学
  • 4 篇 农学
  • 2 篇 艺术学
  • 1 篇 教育学

主题

  • 3,229 篇 approximation al...
  • 222 篇 scheduling
  • 80 篇 combinatorial op...
  • 73 篇 approximation al...
  • 68 篇 np-hard
  • 68 篇 computational co...
  • 65 篇 np-hardness
  • 64 篇 linear programmi...
  • 61 篇 np-complete
  • 56 篇 optimization
  • 53 篇 facility locatio...
  • 51 篇 traveling salesm...
  • 51 篇 graph algorithm
  • 46 篇 wireless sensor ...
  • 45 篇 worst-case analy...
  • 45 篇 vertex cover
  • 45 篇 makespan
  • 45 篇 network design
  • 43 篇 computational ge...
  • 43 篇 dynamic programm...

机构

  • 52 篇 univ alberta dep...
  • 50 篇 univ texas dalla...
  • 38 篇 shandong jianzhu...
  • 37 篇 iit dept comp sc...
  • 37 篇 nanjing univ sta...
  • 34 篇 tianjin univ tec...
  • 33 篇 city univ hong k...
  • 32 篇 univ new brunswi...
  • 31 篇 shandong normal ...
  • 29 篇 shandong univ sc...
  • 27 篇 renmin univ chin...
  • 24 篇 yunnan univ sch ...
  • 24 篇 chinese acad sci...
  • 23 篇 hangzhou dianzi ...
  • 20 篇 beijing univ tec...
  • 18 篇 zhejiang normal ...
  • 17 篇 beijing univ tec...
  • 17 篇 beijing univ tec...
  • 17 篇 univ wisconsin d...
  • 16 篇 univ texas dalla...

作者

  • 92 篇 xu dachuan
  • 52 篇 du donglei
  • 49 篇 wu weili
  • 47 篇 lin guohui
  • 44 篇 wu chenchen
  • 44 篇 zhang zhao
  • 42 篇 li deying
  • 34 篇 zhang dongmei
  • 30 篇 li min
  • 30 篇 du ding-zhu
  • 29 篇 chen yong
  • 28 篇 zhang an
  • 27 篇 yu wei
  • 25 篇 dai haipeng
  • 25 篇 liu zhaohui
  • 25 篇 wang wei
  • 25 篇 li weidong
  • 25 篇 chen guihai
  • 24 篇 dumitrescu adria...
  • 24 篇 zhang peng

语言

  • 3,001 篇 英文
  • 214 篇 其他
  • 13 篇 中文
  • 2 篇 法文
  • 1 篇 德文
检索条件"主题词=approximation algorithm"
3229 条 记 录,以下是3101-3110 订阅
排序:
approximation algorithms for min-sum p-clustering
收藏 引用
DISCRETE APPLIED MATHEMATICS 1998年 第1-3期89卷 125-142页
作者: Guttmann-Beck, N Hassin, R Tel Aviv Univ Dept Stat & Operat Res IL-69978 Tel Aviv Israel
We consider the following problem: Given a graph with edge lengths satisfying the triangle inequality, partition its node set into p subsets, minimizing the total length of edges whose two ends are in the same subset.... 详细信息
来源: 评论
Preemptive scheduling with job-dependent setup times  99
Preemptive scheduling with job-dependent setup times
收藏 引用
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
作者: Petra Schuurman Gerhard J. Woeginger Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513 5600 MB Eindhoven The Netherlands Institut für Mathematik TU Graz Steyrergwe 30 A-8010 Graz Austria
来源: 评论
Using homogenous weights for approximating the partial cover problem  99
Using homogenous weights for approximating the partial cover...
收藏 引用
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
作者: Reuven Bar-Yehuda Computer Science Department Technion - IIT Haifa 32000 Israel
来源: 评论
On-line and off-line approximation algorithms for vector covering problems
收藏 引用
algorithmICA 1998年 第1期21卷 104-118页
作者: Alon, N Azar, Y Csirik, J Epstein, L Sevastianov, SV Vestjens, APA Woeginger, GJ Tel Aviv Univ Raymond & Beverly Sackler Fac Exact Sci Dept Math IL-69978 Tel Aviv Israel Tel Aviv Univ Dept Comp Sci IL-69978 Tel Aviv Israel Univ Szeged Dept Comp Sci H-6720 Szeged Hungary Russian Acad Sci Inst Math Novosibirsk 630090 Russia Eindhoven Univ Technol Dept Math & Comp Sci NL-5600 MB Eindhoven Netherlands Graz Tech Univ Inst Math B A-8010 Graz Austria
This paper deals with vector covering problems in d-dimensional space. The input to a vector covering problem consists of a set X of d-dimensional vectors in [0, 1](d). The goal is to partition X into a maximum number... 详细信息
来源: 评论
Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 1998年 第11期47卷 1253-1266页
作者: Cho, JD Raje, S Sarrafzadeh, M Sungkyunkwan Univ Dept Elect Engn Suwon 440746 South Korea Northwestern Univ Dept Elect Engn & Comp Sci Evanston IL 60208 USA
There are a number of VLSI problems that have a common structure. We investigate such a structure that leads to a unified approach for three independent VLSI layout problems: partitioning, placement, and via minimizat... 详细信息
来源: 评论
Improving a family of approximation algorithms to edge color multigraphs
收藏 引用
INFORMATION PROCESSING LETTERS 1998年 第1期68卷 11-15页
作者: Caprara, A Rizzi, R Univ Bologna DEIS I-40136 Bologna Italy Univ Trent Dipartimento Matemat I-38050 Povo TN Italy
Given a multigraph G = (V, E), the Edge Coloring Problem (ECP) calls for the minimum number chi of colors needed to color the edges in E so that all edges incident with a common node are assigned different colors. The... 详细信息
来源: 评论
New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen
收藏 引用
SIAM JOURNAL ON COMPUTING 1998年 第1期28卷 254-262页
作者: Awerbuch, B Azar, Y Blum, A Vempala, S Johns Hopkins Univ Dept Comp Sci Baltimore MD 21218 USA Tel Aviv Univ Dept Comp Sci IL-69978 Tel Aviv Israel Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA MIT Comp Sci Lab Cambridge MA 02139 USA
We consider a formalization of the following problem. A salesperson must sell some quota of brushes in order to win a trip to Hawaii. This salesperson has a map (a weighted graph) in which each city has an attached de... 详细信息
来源: 评论
A natural family of optimization problems with arbitrarily small approximation thresholds
收藏 引用
INFORMATION PROCESSING LETTERS 1998年 第5期68卷 241-248页
作者: Guruswami, V Rangan, CP Indian Inst Technol Dept Comp Sci & Engn Madras 600036 Tamil Nadu India MIT Comp Sci Lab Cambridge MA 02139 USA
We give a concrete example of a family of natural graph-theoretic problems which behave better and better with respect to approximability but none of which are Likely to admit a polynomial time approximation scheme. M... 详细信息
来源: 评论
Makespan minimization in open shops: A polynomial time approximation scheme
收藏 引用
MATHEMATICAL PROGRAMMING 1998年 第1-2期82卷 191-198页
作者: Sevastianov, SV Woeginger, GJ Russian Acad Sci Inst Math Siberian Branch Novosibirsk 630090 90 Russia Graz Tech Univ Inst Math B A-8010 Graz Austria
In this paper, we demonstrate the existence of a polynomial time approximation scheme for makespan minimization in the open shop scheduling problem with an a:arbitrary fixed number m of machines. For the variant of th... 详细信息
来源: 评论
Recognizing polygonal parts from width measurements
收藏 引用
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS 1998年 第4期9卷 237-246页
作者: Arkin, EM Held, M Mitchell, JSB Skiena, SS SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY 11794 USA Salzburg Univ Inst Comp Wissensch A-5020 Salzburg Austria SUNY Stony Brook Dept Comp Sci Stony Brook NY 11794 USA
Automatic recognition of parts is an important problem in many industrial applications. One model of the problem is: given a finite set of polygonal parts, use a set of "width" measurements taken by a parall... 详细信息
来源: 评论