Sciweavers

2446 search results - page 229 / 490
» Choiceless Polynomial Time
Sort
View
INFOCOM
2006
IEEE
14 years 2 months ago
Maximum Throughput and Fair Bandwidth Allocation in Multi-Channel Wireless Mesh Networks
— Wireless mesh network is designed as an economical solution for last-mile broadband Internet access. In this paper, we study bandwidth allocation in multi-channel multihop wire...
Jian Tang, Guoliang Xue, Weiyi Zhang
IPPS
2006
IEEE
14 years 2 months ago
Distributed algorithm for a color assignment on asynchronous rings
We study a version of the β-assignment problem [3] on asynchronous rings: consider a set of items and a set of m colors, where each item is associated to one color. Consider also...
Gianluca De Marco, Mauro Leoncini, Manuela Montang...
ASM
2005
ASM
14 years 1 months ago
RAM Simulation of BGS Model of Abstract State Machines
lation of BGS model of Abstract State Machines Comandur Seshadhri1 , Anil Seth2 , and Somenath Biswas2 1 Department of Computer Science Princeton University, Princeton NJ 08544, US...
Seshadhri Comandur, Anil Seth, Somenath Biswas
ESA
2005
Springer
145views Algorithms» more  ESA 2005»
14 years 1 months ago
Approximation Schemes for Minimum 2-Connected Spanning Subgraphs in Weighted Planar Graphs
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
André Berger, Artur Czumaj, Michelangelo Gr...
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 1 months ago
Unbalanced Graph Cuts
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
Ara Hayrapetyan, David Kempe, Martin Pál, Z...