Join Our Newsletter

JGT

2010

12 years 1 days ago
2010

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...

CORR

2007

Springer

12 years 1 months ago
2007

Springer

Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, ﬁnd an s-t walk of total length at ...

CORR

2007

Springer

12 years 1 months ago
2007

Springer

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...

COMBINATORICS

2006

12 years 1 months ago
2006

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...

APPROX

2008

Springer

12 years 3 months ago
2008

Springer

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...

ISAAC

2003

Springer

12 years 6 months ago
2003

Springer

We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at speciﬁc nodes in order to maximize their...

INFOCOM

2003

IEEE

12 years 6 months ago
2003

IEEE

— 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...

FOCS

2006

IEEE

12 years 7 months ago
2006

IEEE

Given an undirected hypergraph and a subset of vertices S ⊆ V with a speciﬁed root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to ﬁnd an orientation of all the...

WEA

2010

Springer

12 years 8 months ago
2010

Springer

Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity ﬂow formulations, which are bas...