7129 search results - page 227 / 1426 » Approximation Algorithms for Treewidth |
138
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
131
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
127
click to vote
DISOPT
2010
15 years 4 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
132
Voted
ICTCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
122
Voted
CAD
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents geometric algorithms for developing a re-configurable tooling system for fabrication of freeform objects. The proposed method involves a mold block, with n fac...