5595 search results - page 42 / 1119 » Approximation Algorithms for Clustering Problems |
102
Voted
JAL
2002
15 years 2 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
86
Voted
WG
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
ICCAD
2007
IEEE
15 years 11 months ago
2007
IEEE
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
165
Voted
COCOON
2004
Springer
15 years 8 months ago
2004
Springer
The problem of efficiently monitoring the network flow is regarded as the one to find out the minimum weighted weak vertex cover set for a given graph G = (V, E) with weight func...
154
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...