Sciweavers

46 search results - page 5 / 10
» On Approximating Restricted Cycle Covers
Sort
View
STACS
2009
Springer
14 years 2 months ago
On Approximating Multi-Criteria TSP
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...
Bodo Manthey
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 7 months ago
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
In multi-criteria optimization, several objective functions are to be optimized. Since the different objective functions are usually in conflict with each other, one cannot conside...
Bodo Manthey, L. Shankar Ram
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
13 years 6 months ago
Hardness Results for Homology Localization
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
Chao Chen, Daniel Freedman
CSL
2001
Springer
14 years 1 days ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...
Frédéric Koriche
RANDOM
1998
Springer
13 years 11 months ago
A Derandomization Using Min-Wise Independent Permutations
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
Andrei Z. Broder, Moses Charikar, Michael Mitzenma...