Sciweavers

7 search results - page 1 / 2
» Covering symmetric semi-monotone functions
Sort
View
DAM
2008
139views more  DAM 2008»
13 years 4 months ago
Covering symmetric semi-monotone functions
We define a new set of functions called semi-monotone, a subclass of skew-supermodular functions. We show that the problem of augmenting a given graph to cover a symmetric semi-mo...
Roland Grappe, Zoltán Szigeti
ECCC
2010
89views more  ECCC 2010»
13 years 4 months ago
Lower bounds for designs in symmetric spaces
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree pol...
Noa Eidelstein, Alex Samorodnitsky
CORR
2006
Springer
146views Education» more  CORR 2006»
13 years 4 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
CF
2008
ACM
13 years 6 months ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman
STACS
2009
Springer
13 years 11 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