Sciweavers

578 search results - page 51 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
COR
2007
108views more  COR 2007»
13 years 8 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
HICSS
2002
IEEE
172views Biometrics» more  HICSS 2002»
14 years 1 months ago
Collaborative Software Development: A Discussion of Problem Solving Models and Groupware Technologies
Teamwork is always challenging. Adding the complication of problem solving and software design only amplifies this challenge. The challenges of developing software as a team can b...
Joanna DeFranco-Tommarello, Fadi P. Deek
EOR
2010
159views more  EOR 2010»
13 years 3 months ago
An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
The vehicle routing problem with multiple use of vehicles is a variant of the classical vehicle routing problem. It arises when each vehicle performs several routes during the wor...
Nabila Azi, Michel Gendreau, Jean-Yves Potvin
MFCS
2009
Springer
14 years 3 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
WINE
2005
Springer
135views Economy» more  WINE 2005»
14 years 2 months ago
On Solving Coverage Problems in a Wireless Sensor Network Using Voronoi Diagrams
Owing to numerous potential applications, wireless sensor networks have been the focus of a lot of research efforts lately. In this note we study one fundamental issue in such net...
Anthony Man-Cho So, Yinyu Ye