1433 search results - page 96 / 287 » On Covering Problems of Rado |
185
click to vote
APPROX
2009
Springer
16 years 28 days ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
172
click to vote
SIROCCO
2004
15 years 7 months ago
2004
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...
164
click to vote
IJLIT
2010
15 years 4 months ago
2010
Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...
149
click to vote
JCIT
2010
15 years 1 months ago
2010
This review paper presents an overview of the current state of the art in Problem Solving Environments (PSE). PSE provides integrated human-friendly innovative computational servi...
172
click to vote
ICSE
2007
IEEE-ACM
16 years 14 days ago
2007
IEEE-ACM
This tutorial teaches professional developers design principles for “production-quality”, aspect-oriented software, written in Java/AspectJ and Ruby. The discussion starts wit...