1933 search results - page 99 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
126
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
152
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
134
Voted
ESA
2008
Springer
15 years 5 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
113
Voted
ACSAC
2001
IEEE
15 years 7 months ago
2001
IEEE
It is a well-known problem that intrusion detection systems overload their human operators by triggering thousands of alarms per day. As a matter of fact, we have been asked by on...
125
Voted
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...