2137 search results - page 111 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
133
click to vote
AAAI
2004
15 years 6 months ago
2004
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
125
click to vote
SODA
1997
ACM
15 years 6 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
168
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
135
click to vote
CPC
2007
15 years 4 months ago
2007
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
140
click to vote
CAAN
2006
Springer
15 years 8 months ago
2006
Springer
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a confl...