NETWORKS 2006 | Sciweavers

11

click to vote

NETWORKS
2006

87views Computer Networks» more NETWORKS 2006»

Fault-tolerant routings with minimum optical index

13 years 4 months ago

Download www.math.uwaterloo.ca

Jeffrey H. Dinitz, Alan C. H. Ling, Douglas R. Sti...

claim paper

Read More »

11

click to vote

NETWORKS
2006

106views Computer Networks» more NETWORKS 2006»

Black hole search in common interconnection networks

13 years 4 months ago

Download www.site.uottawa.ca

Mobile agents operating in networked environments face threats from other agents as well as from the hosts (i.e., network sites) they visit. A black hole is a harmful host that de...

Stefan Dobrev, Paola Flocchini, Rastislav Kralovic...

claim paper

Read More »

10

click to vote

NETWORKS
2006

121views Computer Networks» more NETWORKS 2006»

A simple algorithm that proves half-integrality of bidirected network programming

13 years 4 months ago

Download www.math.binghamton.edu

In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...

Ethan D. Bolker, Thomas Zaslavsky

claim paper

Read More »

8

click to vote

NETWORKS
2006

76views Computer Networks» more NETWORKS 2006»

Efficiency and fairness of system-optimal routing with user constraints

13 years 4 months ago

Download www.columbia.edu

Andreas S. Schulz, Nicolás E. Stier Moses

claim paper

Read More »

13

click to vote

NETWORKS
2006

128views Computer Networks» more NETWORKS 2006»

The approach-dependent, time-dependent, label-constrained shortest path problem

13 years 4 months ago

Download scholar.lib.vt.edu

Hanif D. Sherali, Chawalit Jeenanunta, Antoine G. ...

claim paper

Read More »

11

click to vote

NETWORKS
2006

93views Computer Networks» more NETWORKS 2006»

Extreme point characterizations for infinite network flow problems

13 years 4 months ago

Download www-personal.umich.edu

We study capacitated network flow problems with supplies and demands defined on a countably infinite collection of nodes having finite degree. This class of network flow models in...

H. Edwin Romeijn, Dushyant Sharma, Robert L. Smith

claim paper

Read More »

8

click to vote

NETWORKS
2006

73views Computer Networks» more NETWORKS 2006»

An improved deniable authentication protocol

13 years 4 months ago

Download paper.ijcsns.org

Jun Shao, Zhenfu Cao, Rongxing Lu

claim paper

Read More »

9

click to vote

NETWORKS
2006

98views Computer Networks» more NETWORKS 2006»

Fault tolerant on-board networks with priorities

13 years 4 months ago

Download www.i3s.unice.fr

Jean-Claude Bermond, Frédéric Havet,...

claim paper

Read More »

9

click to vote

NETWORKS
2006

89views Computer Networks» more NETWORKS 2006»

Approximation algorithms for channel allocation problems in broadcast networks

13 years 4 months ago

Download www.cs.umd.edu

We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...

Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, N...

claim paper

Read More »

10

click to vote

NETWORKS
2006

71views Computer Networks» more NETWORKS 2006»

Upgrading arcs to minimize the maximum travel time in a network

13 years 4 months ago