2254 search results - page 112 / 451 » Computing the minimal covering set |
335
click to vote
Publication
Location discovery is a fundamental problem in wireless ad hoc networks. Most of the ad hoc routing protocols use some form of flooding to discover the location and route of a mobi...
257
click to vote
COR
2011
15 years 1 months ago
2011
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
151
click to vote
WADS
2007
Springer
16 years 19 days ago
2007
Springer
In the maximum sharing problem (MS), we want to compute a set of (non-simple) paths in an undirected bipartite graph covering as many nodes as possible of the first layer of the ...
148
click to vote
ICALP
2005
Springer
16 years 1 days ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
159
click to vote
ICC
2009
IEEE
16 years 1 months ago
2009
IEEE
— A powerful path computation element is a must for the next-generation IP-over-Optical networks to support ondemand service provisioning crossing layers. The main purpose of pat...