Results 271 to 280 of about 156,468 (326)

Respecting Lower Bounds In Uniform Lower and Upper Bounded Facility Location Problem

Theoretical Computer Science, 2021
With growing emphasis on e-commerce marketplace platforms where we have a central platform mediating between the seller and the buyer, it becomes important to keep a check on the availability and profitability of the central store. A store serving too less clients can be non-profitable and a store getting too many orders can lead to bad service to the ...
Neelima Gupta, Sapna Grover, Rajni Dabas
openaire   +2 more sources

Lower bounds and upper bounds for chromatic polynomials

Journal of Graph Theory, 1993
AbstractIn this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on n vertices having m edges and girth exceeding g © 1993 John Wiley & Sons, Inc.
openaire   +3 more sources

An upper and a lower bound for tick synchronization

[1992] Proceedings Real-Time Systems Symposium, 2003
The tick synchronization problem is defined and studied in the semisynchronous complete network with n processes. An algorithm for the tick synchronization problem enables each process to make an estimate of real time close enough to those of other processes.
Mavronicolas, Marios, Mavronicolas, Marios   +1 more
openaire   +2 more sources

Upper and Lower Bounds for Stochastic Processes

Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge / A Series of Modern Surveys in Mathematics, 2021
M. Talagrand
semanticscholar   +1 more source

Lower and upper bounds on graph communicabilities

Information Processing Letters
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh   +1 more
openaire   +3 more sources

Upper and lower bounds for the dictionary problem

1988
We give a randomized algorithm for the dictionary problem with O(1) worst case time for lookup and O(1) expected amortized time for insertion and deletion. We also prove an Ω(log n) lower bound on the amortized worst case time complexity of any deterministic algorithm based on hashing. Furthermore, if the worst case lookup time is restricted to k, then
Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H.   +3 more
openaire   +2 more sources

Lower and upper bounds for stokes eigenvalues

Calcolo
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yue, Yifan, Chen, Hongtao, Zhang, Shuo
openaire   +1 more source

Correlation lower bounds from correlation upper bounds

Information Processing Letters, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shiteng Chen, Periklis A. Papakonstantinou   +1 more
openaire   +4 more sources

The upper bound and lower bound of the genus of pancake graphs

2009 IEEE Symposium on Computers and Communications, 2009
Both the pancake graph and star graph are Cayley graphs and are especially attractive for parallel processing. They both have sublogarithmic diameter, and are fairly sparse compared to hypercubes. In this paper, we focus on another important property, namely the genus.
Quan T. Nguyen, Saïd Bettayeb
openaire   +1 more source

Improved upper and lower bounds fork-broadcasting

Networks, 2001
Summary: We continue the investigation of \(k\)-broadcasting, a variant of broadcasting in which an informed vertex can call up to \(k\) of its neighbors in each time unit. A focus of the investigation into broadcasting is the function \(B_k(n)\), which is the minimum number of edges in any \(n\) vertex graph such that each vertex can originate a \(k\)-
Hovhannes A. Harutyunyan, Arthur L. Liestman   +1 more
openaire   +3 more sources