Sciweavers

511 search results - page 78 / 103
» TSP with bounded metrics
Sort
View
POPL
2010
ACM
16 years 3 months ago
Static Determination of Quantitative Resource Usage for Higher-Order Programs
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
16 years 3 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
CCA
2009
Springer
16 years 16 days ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
ISAAC
2007
Springer
102views Algorithms» more  ISAAC 2007»
16 years 3 days ago
Depth of Field and Cautious-Greedy Routing in Social Networks
Social networks support efficient decentralized search: people can collectively construct short paths to a specified target in the network. Rank-based friendship—where the prob...
David Barbella, George Kachergis, David Liben-Nowe...
PODC
2004
ACM
15 years 11 months ago
Signed quorum systems
Abstract With n servers that independently fail with probability of p < 0.5, it is well known that the majority quorum system achieves the best availability among all quorum sys...
Haifeng Yu