Sciweavers

9119 search results - page 127 / 1824
» A Simultaneous Search Problem
Sort
View
90
Voted
IJCGA
2006
79views more  IJCGA 2006»
15 years 22 days ago
Well-constrained Completion and Decomposition for under-constrained Geometric Constraint Problems
In this paper, we consider the optimal well-constrained completion problem, that is, for an under-constrained geometric constraint problem, add automatically new constraints in suc...
Gui-Fang Zhang, Xiao-Shan Gao
67
Voted
SIAMJO
2008
57views more  SIAMJO 2008»
15 years 20 days ago
Universal Confidence Sets for Solutions of Optimization Problems
We consider random approximations to deterministic optimization problems. The objective function and the constraint set can be approximated simultaneously. Relying on concentratio...
Silvia Vogel
74
Voted
WG
2005
Springer
15 years 6 months ago
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...
103
Voted
LATIN
2010
Springer
14 years 11 months ago
The Interval Constrained 3-Coloring Problem
Abstract In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if th...
Jaroslaw Byrka, Andreas Karrenbauer, Laura Sanit&a...
95
Voted
DAM
2008
68views more  DAM 2008»
15 years 25 days ago
Parameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
Henning Fernau