500 search results - page 35 / 100 » Approximation algorithms for maximum independent set of pseu... |
123
click to vote
STACS
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
132
click to vote
CORR
2008
Springer
15 years 1 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...
127
click to vote
ESA
2003
Springer
15 years 7 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
105
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
127
click to vote
INFOCOM
2003
IEEE
15 years 7 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...