skip to main content
Refinado por: assunto: Mathematics remover tipo de recurso: Artigos remover Nome da Publicação: Journal of Combinatorial Optimization remover autor: Wu, Weili remover
Result Number Material Type Add to My Shelf Action Record Details and Options
1
A better constant-factor approximation for weighted dominating set in unit disk graph
Material Type:
Artigo
Adicionar ao Meu Espaço

A better constant-factor approximation for weighted dominating set in unit disk graph

Huang, Yaochun ; Gao, Xiaofeng ; Zhang, Zhao ; Wu, Weili

Journal of combinatorial optimization, 2009-08, Vol.18 (2), p.179-194 [Periódico revisado por pares]

Boston: Springer US

Texto completo disponível

2
A greedy algorithm for the fault-tolerant connected dominating set in a general graph
Material Type:
Artigo
Adicionar ao Meu Espaço

A greedy algorithm for the fault-tolerant connected dominating set in a general graph

Zhou, Jiao ; Zhang, Zhao ; Wu, Weili ; Xing, Kai

Journal of combinatorial optimization, 2014-07, Vol.28 (1), p.310-319 [Periódico revisado por pares]

Boston: Springer US

Texto completo disponível

3
A greedy algorithm for the minimum $$2$$ 2 -connected $$m$$ m -fold dominating set problem
Material Type:
Artigo
Adicionar ao Meu Espaço

A greedy algorithm for the minimum $$2$$ 2 -connected $$m$$ m -fold dominating set problem

Shi, Yishuo ; Zhang, Yaping ; Zhang, Zhao ; Wu, Weili

Journal of combinatorial optimization, 2016-01, Vol.31 (1), p.136-151 [Periódico revisado por pares]

Springer Science and Business Media LLC

Texto completo disponível

4
Algorithms for randomized time-varying knapsack problems
Material Type:
Artigo
Adicionar ao Meu Espaço

Algorithms for randomized time-varying knapsack problems

He, Yichao ; Zhang, Xinlu ; Li, Wenbin ; Li, Xiang ; Wu, Weili ; Gao, Suogang

Journal of combinatorial optimization, 2016-01, Vol.31 (1), p.95-117 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

5
An approximation for minimum multicast route in optical networks with nonsplitting nodes
Material Type:
Artigo
Adicionar ao Meu Espaço

An approximation for minimum multicast route in optical networks with nonsplitting nodes

Guo, Longjiang ; Wu, Weili ; Wang, Feng ; Thai, My

Journal of combinatorial optimization, 2005-12, Vol.10 (4), p.391-394 [Periódico revisado por pares]

Norwell, MA: Springer

Texto completo disponível

6
Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
Material Type:
Artigo
Adicionar ao Meu Espaço

Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties

Zheng, Hongye ; Gao, Suogang ; Liu, Wen ; Wu, Weili ; Du, Ding-Zhu ; Hou, Bo

Journal of combinatorial optimization, 2022-08, Vol.44 (1), p.343-353 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

7
Better approximation algorithms for influence maximization in online social networks
Material Type:
Artigo
Adicionar ao Meu Espaço

Better approximation algorithms for influence maximization in online social networks

Zhu, Yuqing ; Wu, Weili ; Bi, Yuanjun ; Wu, Lidong ; Jiang, Yiwei ; Xu, Wen

Journal of combinatorial optimization, 2015-07, Vol.30 (1), p.97-108 [Periódico revisado por pares]

New York: Springer US

Texto completo disponível

8
Broadcast routing with minimum wavelength conversion in WDM optical networks
Material Type:
Artigo
Adicionar ao Meu Espaço

Broadcast routing with minimum wavelength conversion in WDM optical networks

Ruan, Lu ; Wu, Weili

Journal of combinatorial optimization, 2005-03, Vol.9 (2), p.223-235 [Periódico revisado por pares]

Norwell, MA: Springer

Texto completo disponível

9
Constructing error-correcting pooling designs with symplectic space
Material Type:
Artigo
Adicionar ao Meu Espaço

Constructing error-correcting pooling designs with symplectic space

Guo, Jun ; Wang, Yuexuan ; Gao, Suogang ; Yu, Jiangchen ; Wu, Weili

Journal of combinatorial optimization, 2010-11, Vol.20 (4), p.413-421 [Periódico revisado por pares]

Boston: Springer US

Texto completo disponível

10
Constructing weakly connected dominating set for secure clustering in distributed sensor network
Material Type:
Artigo
Adicionar ao Meu Espaço

Constructing weakly connected dominating set for secure clustering in distributed sensor network

Du, Hongjie ; Wu, Weili ; Shan, Shan ; Kim, Donghyun ; Lee, Wonjun

Journal of combinatorial optimization, 2012-02, Vol.23 (2), p.301-307 [Periódico revisado por pares]

Boston: Springer US

Texto completo disponível

Buscando em bases de dados remotas. Favor aguardar.