Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
— In wireless local area networks (WLANs), quality of service (QoS) can be provided by mapping applications with different requirements (e.g., delay and throughput) into one of t...
Man Hon Cheung, Amir Hamed Mohsenian Rad, Vincent ...
In the standard model of observational learning, n agents sequentially decide between two alternatives a or b, one of which is objectively superior. Their choice is based on a stoc...
Julian Lorenz, Martin Marciniszyn, Angelika Steger
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Abstract—We consider a cognitive radio network where multiple secondary users (SUs) contend for spectrum usage, using random access, over available primary user (PU) channels. Ou...