Sciweavers

1257 search results - page 177 / 252
» A generalization of Euler's constant
Sort
View
ECCC
2000
93views more  ECCC 2000»
13 years 7 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
CPC
2002
95views more  CPC 2002»
13 years 7 months ago
Permutation Pseudographs And Contiguity
The space of permutation pseudographs is a probabilistic model of 2-regular pseudographs on n vertices, where a pseudograph is produced by choosing a permutation of {1, 2, . . . ...
Catherine S. Greenhill, Svante Janson, Jeong Han K...
RCC
2000
113views more  RCC 2000»
13 years 7 months ago
The Aristotle Approach to Open Hypermedia
Large-scale distributed hypermedia systems comprise a generation of powerful tools to meet the demands of the new information globalization era. The most promising of such systems...
Costas Petrou, Drakoulis Martakos, Michael Hatzopo...
ALGORITHMICA
1998
90views more  ALGORITHMICA 1998»
13 years 7 months ago
Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators
We provide here a complete average-case analysis of the binary continued fraction representation of a random rational whose numerator and denominator are odd and less than N. We an...
Brigitte Vallée
COMGEO
1998
ACM
13 years 7 months ago
The union of moving polygonal pseudodiscs - Combinatorial bounds and applications
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
Mark de Berg, Hazel Everett, Leonidas J. Guibas