Sciweavers

6 search results - page 1 / 2
» Feasible edge colorings of trees with cardinality constraint...
Sort
View
DM
2000
103views more  DM 2000»
13 years 3 months ago
Feasible edge colorings of trees with cardinality constraints
A variation of preemptive open shop scheduling corresponds to
Dominique de Werra, Alain Hertz, Daniel Kobler, Na...
ICALP
2003
Springer
13 years 8 months ago
Multicommodity Demand Flow in a Tree
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepher...
MFCS
1995
Springer
13 years 7 months ago
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
Osamu Maruyama, Satoru Miyano
SAC
2000
ACM
13 years 8 months ago
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
Günther R. Raidl, Bryant A. Julstrom
FOCS
2008
IEEE
13 years 10 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...