NETWORKS 2002 - PDF Preprint Papers

NETWORKS 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed NETWORKS-2002 Paper

click to vote

NETWORKS
2002

186views Computer Networks» more NETWORKS 2002»

Approximation algorithms for constructing wavelength routing networks

13 years 11 months ago

Download pluto.huji.ac.il

Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...

Refael Hassin, Asaf Levin

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	186	Approximation algorithms for constructing wavelength routing networks	claim
2	134	Node-disjoint paths and related problems on hierarchical cubic networks	claim
3	119	Shortest-path network interdiction	claim
4	96	Augmented cubes	claim
5	80	Isomorphisms of the De Bruijn digraph and free-space optical networks	claim
6	73	Superconnected digraphs and graphs with small conditional diameters	claim
7	71	Degree- and time-constrained broadcast networks	claim
8	66	Partial line directed hypergraphs	claim
9	63	Lazy evaluation in penniless propagation over join trees	claim
10	63	Light graphs with small routing cost	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers