Sciweavers

3192 search results - page 79 / 639
» The minimum latency problem
Sort
View
CATS
1998
14 years 11 months ago
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
Weifa Liang, George Havas
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
14 years 10 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi
INFOCOM
2006
IEEE
15 years 4 months ago
Minimum-Energy Broadcast Using Practical Directional Antennas in All-Wireless Networks
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
Sabyasachi Roy, Y. Charlie Hu, Dimitrios Peroulis,...
73
Voted
SODA
2010
ACM
409views Algorithms» more  SODA 2010»
15 years 7 months ago
Data Structures for Range Minimum Queries in Multidimensional Arrays
Given a d-dimensional array A with N entries, the Range Minimum Query (RMQ) asks for the minimum element within a contiguous subarray of A. The 1D RMQ problem has been studied int...
Hao Yuan, Mikhail J. Atallah
ICCAD
1997
IEEE
101views Hardware» more  ICCAD 1997»
15 years 2 months ago
Minimum area retiming with equivalent initial states
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
Naresh Maheshwari, Sachin S. Sapatnekar