Sciweavers

1963 search results - page 275 / 393
» The Maximum Solution Problem on Graphs
Sort
View
132
Voted
PODC
1989
ACM
15 years 4 months ago
Multiple Communication in Multi-Hop Radio Networks
Two tasks of communication in a multi-hop synchronous radio network are considered: point-to-point communication and broadcast (sending a message to all nodes of a network). Effi...
Reuven Bar-Yehuda, Amos Israeli
JCO
2006
126views more  JCO 2006»
15 years 19 days ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
109
Voted
ATMOS
2007
119views Optimization» more  ATMOS 2007»
15 years 2 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
124
Voted
IWCMC
2006
ACM
15 years 6 months ago
A heuristics based approach for cellular mobile network planning
Designing and planning of the switching, signaling and support network is a fairly complex process in cellular mobile network. In this paper, the problem of assigning cells to swi...
Marwan H. Abu-Amara, Sadiq M. Sait, Abdul Subhan
ECCC
2006
88views more  ECCC 2006»
15 years 20 days ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna