Titlebook: ;

ingenue

OMIT

調(diào)色板

On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networ several optimization problems. They include offline and online scenarios, and concern problems that optimize the use of components in the optical networks, specifically Add-Drop Multiplexers (ADMs) and regenerators.

HAUNT

Minimum Eccentricity Shortest Paths in Some Structured Graph Classest is NP-hard in general graphs, we demonstrate that a minimum eccentricity shortest path can be found in linear time for distance-hereditary graphs (generalizing the previous result for trees) and in . time for chordal graphs.

肥料

雇傭兵

Incumbent

條約

ASTER

On the Number of Minimal Separators in GraphsWe consider the largest number of minimal separators a graph on . vertices can have..This gives also an improved lower bound on the number of potential maximal cliques in a graph. We would like to emphasize that our proofs are short, simple, and elementary.

Acquired