982 search results - page 76 / 197 » Solving Steiner tree problems in graphs to optimality |
AICT
2006
IEEE
15 years 4 months ago
2006
IEEE
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
SOFSEM
1997
Springer
15 years 2 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
STOC
1995
ACM
15 years 1 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
INFOCOM
2002
IEEE
15 years 2 months ago
2002
IEEE
—A Virtual Private Network (VPN) aims to emulate the services provided by a private network over the shared Internet. The endpoints of e connected using abstractions such as Virt...