Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
JGT
2010
128views more  JGT 2010»
10 years 9 months ago
On antimagic directed graphs
An antimagic labeling of an undirected graph G with n vertices and m edges is a bijection from the set of edges of G to the integers {1, . . . , m} such that all n vertex sums are...
Dan Hefetz, Torsten Mütze, Justus Schwartz
CORR
2007
Springer
167views Education» more  CORR 2007»
10 years 10 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
CORR
2007
Springer
113views Education» more  CORR 2007»
10 years 10 months ago
Note on edge-colored graphs and digraphs without properly colored cycles
We study the following two functions: d(n, c) and d(n, c); d(n, c) (d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and mini...
Gregory Gutin
COMBINATORICS
2006
119views more  COMBINATORICS 2006»
10 years 10 months ago
Relaxations of Ore's Condition on Cycles
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
Ahmed Ainouche
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
11 years 16 days ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
ISAAC
2003
Springer
92views Algorithms» more  ISAAC 2003»
11 years 3 months ago
Wavelength Conversion in Shortest-Path All-Optical Networks
We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their...
Thomas Erlebach, Stamatis Stefanakos
INFOCOM
2003
IEEE
11 years 3 months ago
Minimizing Request Blocking in All-Optical Rings
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
Christos Nomikos, Aris Pagourtzis, Stathis Zachos
FOCS
2006
IEEE
11 years 4 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
WEA
2010
Springer
338views Algorithms» more  WEA 2010»
11 years 5 months ago
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi
books