Sciweavers

909 search results - page 22 / 182
» On the approximability of some network design problems
Sort
View
SODA
2008
ACM
184views Algorithms» more  SODA 2008»
15 years 2 months ago
On the approximability of influence in social networks
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
Ning Chen
FOCS
2002
IEEE
15 years 6 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
HEURISTICS
2000
90views more  HEURISTICS 2000»
15 years 1 months ago
Tabu Search for a Network Loading Problem with Multiple Facilities
This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertice...
David Berger, Bernard Gendron, Jean-Yves Potvin, S...
ILP
1999
Springer
15 years 5 months ago
Approximate ILP Rules by Backpropagation Neural Network: A Result on Thai Character Recognition
This paper presents an application of Inductive Logic Programming (ILP) and Backpropagation Neural Network (BNN) to the problem of Thai character recognition. In such a learning pr...
Boonserm Kijsirikul, Sukree Sinthupinyo
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
15 years 6 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang