Titlebook: LATIN 2002: Theoretical Informatics; 5th Latin American S Sergio Rajsbaum Conference proceedings 2002 Springer-Verlag Berlin Heidelberg 200

outer-ear

易于出錯(cuò)

POINT

叢林

出汗

AGONY

遭受

Random Partitions with Non Negative rth Differences .(.) Let .(λ) be a positive .. difference chosen uniformly at random in λ. The aim of this work is to show that for every . ≥ 1, the probability that .(λ) ≥ . approaches the constant .. as . → ∞ This work is a generalization of a result on integer partitions [.] and was motivated by a recent identi

縮影

污穢

Facility Location Constrained to a Polygonal Domaingonal region. Many realistic facility location problems require the facilities to be constrained to lie in a simple polygonal region. Given a set . of . demand points and a simple polygon . of . vertices, we first show how to compute the location of an obnoxious facility constrained to lie in ., in

水土

A Deterministic Polynomial Time Algorithm for Heilbronn’s Problem in Dimension Threeost .(1/..). This conjecture was disproved by Komlós, Pintz and Szemerédi [.] who showed that for every . there exists a configuration of . points in the unit square [0, 1]. where all triangles have area at least ω(log ./..). Here we will consider a 3-dimensional analogue of this problem and we will