667 search results - page 100 / 134 » Approximation algorithms for connected facility location pro... |
80
Voted
ICDCS
2007
IEEE
15 years 6 months ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
105
Voted
JCO
2010
14 years 11 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
116
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
The central problem in computational mechanism design is the tension between incentive compatibility and computational ef ciency. We establish the rst significant approximability ...
114
Voted
ICPR
2002
IEEE
15 years 5 months ago
2002
IEEE
In this paper we introduce a novel graphical image representation comprising a single curve—the one-liner. The first step involves the detection and linking of image edges. We ...
120
click to vote
ICDM
2010
IEEE
14 years 10 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...