2137 search results - page 143 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
154
click to vote
ESA
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
136
click to vote
PVLDB
2010
15 years 3 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
141
click to vote
DAC
1999
ACM
16 years 6 months ago
1999
ACM
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
179
click to vote
AAAI
2010
15 years 6 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
125
click to vote
QEST
2006
IEEE
15 years 11 months ago
2006
IEEE
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...