设为首页
收藏本站
网站地图
|
English
|
公务邮箱
About the library
Background
History
Leadership
Organization
Readers' Guide
Opening Hours
Collections
Help Via Email
Publications
Electronic Information Resources
常用资源
电子图书
期刊论文
学位会议
外文资源
特色专题
内部出版物
CNKI会议论文(1)
CNKI学位论文(197)
CNKI期刊论文0611(1)
知网期刊论文(39)
在“
Elsevier电子期刊
”中,
命中:
8
条,耗时:0.0919574 秒
在所有数据库中总计命中:
238
条
1.
The relation of
Connected
Set
Cover
and Group Steiner Tree
作者:
Khaled Elbassioni
a
;
1
;
elbassio@mpi-inf.mpg.de
;
Slobodan Jeli?
b
;
sjelic@mathos.hr
;
sljelic@gmail.com
;
Domagoj Matijevi?
c
;
2
;
domagoj@mathos.hr
关键词:
Set
cover
;
Connected
set
cover
;
Weighted
connected
set
cover
;
Group Steiner tree
;
Node
weighted
group Steiner tree
;
Cover
ing Steiner tree problem
刊名:Theoretical Computer Science
出版年:2012
2.
New approximations for minimum-
weighted
dominating
set
s and minimum-
weighted
connected
dominating
set
s on unit disk graphs
作者:
Feng Zou
a
;
phenix.zou@student.utdallas.edu
;
Yuexuan Wang
b
;
wangyuexuan@tsinghua.edu.cn
;
Xiao-Hua Xu
c
;
xxu23@iit.edu
;
Xianyue Li
d
;
lixianyue@lzu.edu.cn
;
Hongwei Du
c
;
hongwei@cs.cityu.edu.hk
;
Pengjun Wan
c
;
wan@cs.iit.edu
;
Weili Wu
a
;
weiliwu@utdallas.edu
关键词:
Minimum-
weighted
dominating
set
;
Minimum-
weighted
connected
dominating
set
;
Minimum-
weighted
chromatic disk
cover
;
Node-
weighted
Steiner tree
;
Polynomial-time approximation scheme
;
Approximation algorithm
刊名:Theoretical Computer Science
出版年:2011
3.
Frequency-dependent functional connectivity within resting-state networks: An atlas-based MEG beamformer solution
作者:
Arjan Hillebrand
a
;
a.hillebrand@vumc.nl
;
Gareth R. Barnes
b
;
Johannes L. Bosboom
c
;
Henk W. Berendse
d
;
Cornelis J. Stam
a
关键词:
Beamforming
;
Magnetoencephalography
;
Source modelling
;
Functional connectivity
;
Graph analysis
;
Networks
;
Phase lag index
;
Resting-state
刊名:NeuroImage
出版年:2012
4.
Crown reductions for the Minimum
Weighted
Vertex
Cover
problem
作者:
Miroslav Chlebí
;
k
;
Janka Chlebí
;
ková
关键词:
Vertex
cover
;
Nemhauser–
;
Trotter theorem
;
Crown reductions
刊名:Discrete Applied Mathematics
出版年:2008
5.
Minmax relations for cyclically ordered digraphs
作者:
Andrá
;
s Sebő
关键词:
Stable
set
;
Coloring
;
Orders
;
Cover
ing
;
Packing
;
Polyhedron
;
Network flow
;
Minimum cost flow
刊名:Journal of Combinatorial Theory, Series B
出版年:2007
6.
An improved approximation algorithm for capacitated multicast routings in networks
作者:
Ehab Morsy
;
Hiroshi Nagamochi
关键词:
Approximation algorithm
;
Graph algorithm
;
Multicast routing problem
;
Network optimization
;
Tree
cover
刊名:Theoretical Computer Science
出版年:2008
7.
A primal-dual method for approximating tree
cover
with two weights
作者:
Takashi Doi
;
Toshihiro Fujito
关键词:
Approximation algorithms
;
Tree
cover
;
Primal-dual method
刊名:Discrete Optimization
出版年:2006
8.
Improved Methods for Approximating Node
Weighted
Steiner Trees and
Connected
Dominating
Set
s
作者:
Guha
;
Sudipto
;
Khuller
;
Samir
刊名:Information and Computation
出版年:1999
1
按检索点细分(8)
关键词(2)
文摘(7)
按出版年细分(8)
2012年(2)
2011年(1)
2008年(2)
2007年(1)
2006年(1)
2000年及以前(1)
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via
email
.