Keyword: complexity

Found 45 papers in total
An O(√nL) iteration primal‐dual second‐order corrector algorithm for linear programming
An O(√nL) iteration primal‐dual second‐order corrector algorithm for linear programming
2011,
In this paper, we propose a primal‐dual second‐order corrector interior...
Aspects of a multivariate complexity analysis for Rectangle Tiling
Aspects of a multivariate complexity analysis for Rectangle Tiling
2011,
We identify very restricted cases of Rectangle Tiling that remain NP‐hard....
On the complexity of submodular function minimisation on diamonds
On the complexity of submodular function minimisation on diamonds
2011,
Let ( L ; ⊓ , ⊔ ) be a finite lattice and let n be a...
Testing Convexity Properties of Tree Colorings
Testing Convexity Properties of Tree Colorings
2011,
A coloring of a graph is convex if it induces a partition of the vertices into...
Improved Approximation Algorithms for Label Cover Problems
Improved Approximation Algorithms for Label Cover Problems
2011,
In this paper we consider both the maximization variant Max Rep and the minimization...
FPT algorithms for path‐transversal and cycle‐transversal problems
FPT algorithms for path‐transversal and cycle‐transversal problems
2011,
We study the parameterized complexity of several vertex‐ and...
Parameterized complexity and approximability of the Longest Compatible Sequence problem
Parameterized complexity and approximability of the Longest Compatible Sequence problem
2011,
We introduce the Longest Compatible Sequence ( Slcs ) problem. This problem deals with...
On the directed Full Degree Spanning Tree problem
On the directed Full Degree Spanning Tree problem
2011,
We study the parameterized complexity of a directed analog of the Full Degree Spanning...
Treewidth governs the complexity of target set selection
Treewidth governs the complexity of target set selection
2011,
In this paper we study the Target Set Selection problem proposed by Kempe, Kleinberg,...
Charge and reduce: A fixed‐parameter algorithm for String‐to‐String Correction
Charge and reduce: A fixed‐parameter algorithm for String‐to‐String Correction
2011,
String distance problems typically ask for a minimum number of permitted operations to...
Scheduling UET‐tasks on a star network: complexity and approximation
Scheduling UET‐tasks on a star network: complexity and approximation
2011,
In this article we investigate complexity and approximation on a processor network...
Operational complexity and supplier–customer integration: case study insights and complexity rebound
Operational complexity and supplier–customer integration: case study insights and complexity rebound
2010,
The main contribution of this paper is the demonstration that, contrary to...
On a Global Complexity Bound of the Levenberg‐Marquardt Method
On a Global Complexity Bound of the Levenberg‐Marquardt Method
2010,
In this paper, we investigate a global complexity bound of the...
Taming the complexity dragon
Taming the complexity dragon
2008,
In the first section of this paper, I discuss the pervasive presence of complexity in...
Complexity of the Economic Lot Schedule Problem with general cyclic schedules
Complexity of the Economic Lot Schedule Problem with general cyclic schedules
1997,
We show that the Economic Lot Schedule Problem is NP-hard in the strong sense under...
On the hardness of evaluating criticality of activities in a planar network with duration intervals
On the hardness of evaluating criticality of activities in a planar network with duration intervals
2003,
Complexity results for problems of evaluating the criticality of activities in planar...
The marginal cost of complexity
The marginal cost of complexity
1998,
Complexity is an important issue in supply chain management; new products, new...
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
1996,
In 1954, Johnson gave an efficient algorithm for minimizing makespan in a two-machine...
An O(m log n) algorithm for the max + sum spanning tree problem
An O(m log n) algorithm for the max + sum spanning tree problem
1996,
In a graph in which each edge has two weights, the max + sum spanning tree...
Complexity and industrial management
Complexity and industrial management
1994,
The growth and evolution of complexity in the present industrial environment has...
On the relation between complexity and uncertainty
On the relation between complexity and uncertainty
1989,
In practical problem situations data are usually inherently unreliable. A mathematical...
Papers per page: