Suchergebnisse - "parameterized computation"

ACCELERATED PARAMETERIZED COMPUTATION OF THE THERMAL BEHAVIOUR OF DUAL PURPOSE CASKS von Roppel, Matthias, Lange, Christopher, Roith, Bernd, Rieg, Frank

“… One of the fundamental requirements for dual purpose casks, which are used for the transport and interim storage of spent fuel assemblies, is the safe removal …”
Volltext

On the Parameterized Computation of Minimum Volume Outer Ellipsoid of Minkowski Sum of Ellipsoids von Halder, Abhishek

“… We consider the problem of computing certain parameterized minimum volume outer ellipsoidal (MVOE) approximation of the Minkowski sum of a finite number of …”
Volltext

Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree von Li, Wenjun, Cao, Yixin, Chen, Jianer, Wang, Jianxin

“… The maximum internal spanning tree problem asks for a spanning tree of a given graph that has the maximum number of internal vertices among all spanning trees …”
Volltext

Strong computational lower bounds via parameterized complexity von Chen, Jianer, Huang, Xiuzhen, Kanj, Iyad A., Xia, Ge

“… We develop new techniques for deriving strong computational lower bounds for a class of well-known NP-hard problems. This class includes weighted …”
Volltext

Chordal Editing is Fixed-Parameter Tractable von Cao, Yixin, Marx, Dániel

“… Graph modification problems typically ask for a small set of operations that transforms a given graph to have a certain property. The most commonly considered …”
Volltext

Nearly Time-Optimal Kernelization Algorithms for the Line-Cover Problem with Big Data von Chen, Jianer, Huang, Qin, Kanj, Iyad, Xia, Ge

“… Based on well-known complexity theory conjectures, any polynomial-time kernelization algorithm for the NP-hard Line- Cover problem produces a kernel of size Ω …”
Volltext

A 2k kernel for the cluster editing problem von Chen, Jianer, Meng, Jie

“… The cluster editing problem is a decision problem that, for a graph G and a parameter k, determines if one can apply at most k edge insertion/deletion …”
Volltext

On Feedback Vertex Set: New Measure and New Structures von Cao, Yixin, Chen, Jianer, Liu, Yang

“… We present a new parameterized algorithm for the feedback vertex set problem ( fvs ) on undirected graphs. We approach the problem by considering a variation …”
Volltext

Parameterized Computation and Complexity: A New Approach Dealing with NP-Hardness von Chen, Jian-Er

“… The theory of parameterized computation and complexity is a recently developed subarea in theoretical computer science …”
Volltext

Cluster Editing: Kernelization Based on Edge Cuts von Cao, Yixin, Chen, Jianer

“… Kernelization algorithms for the cluster editing problem have been a popular topic in the recent research in parameterized computation …”
Volltext

An O⁎(1.84k) parameterized algorithm for the multiterminal cut problem von Cao, Yixin, Chen, Jianer, Fan, J.-H.

“… We study the multiterminal cut problem, which, given an n-vertex graph whose edges are integer-weighted and a set of terminals, asks for a partition of the …”
Volltext

A 2 k kernel for the cluster editing problem von Chen, Jianer, Meng, Jie

“… The cluster editing problem is a decision problem that, for a graph G and a parameter k, determines if one can apply at most k edge insertion/deletion …”
Volltext

Evaluation of permanents in rings and semirings von Björklund, Andreas, Husfeldt, Thore, Kaski, Petteri, Koivisto, Mikko

Volltext

On Unknown Small Subsets and Implicit Measures： New Techniques for Parameterized Algorithms von 陈建二 冯启龙

“… Parameterized computation is a recently proposed alternative approach to dealing with NP-hard …”
Volltext

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms von Chen, Jianer, Kanj, Iyad A.

“… A parameterized algorithm is developed for the problem, in which classical results in matching theory and recently developed techniques in parameterized computation theory are nicely combined and extended …”
Volltext

On the Parameterized Computation of Minimum Volume Outer Ellipsoid of Minkowski Sum of Ellipsoids von Halder, Abhishek

“… We consider the problem of computing certain parameterized minimum volume outer ellipsoidal (MVOE) approximation of the Minkowski sum of a finite number of …”
Volltext

Genus characterizes the complexity of certain graph problems: Some tight results von Chen, Jianer, Kanj, Iyad A., Perković, Ljubomir, Sedgwick, Eric, Xia, Ge

“… We study the fixed-parameter tractability, subexponential time computability, and approximability of the well-known NP-hard problems: independent set, vertex …”
Volltext

A Short Note on Parameterized Computation of Network Reliability with respect to Treewidth von Goharshady, Amir Kafshdar, Mohammadi, Fatemeh

“… We consider the classic problem of network reliability. A network is given together with a source vertex, one or more target vertices and probabilities …”
Volltext

A faster parameterized algorithm for set packing von Koutis, Ioannis

“… We present an efficient parameterized algorithm for the ( k , t ) -set packing problem, in which we are looking for a collection of k disjoint sets whose union …”
Volltext

Parameterized complexity and improved inapproximability for computing the largest j-simplex in a V-polytope von Koutis, Ioannis

“… We consider the problem of computing the squared volume of the largest j-simplex contained in an n-dimensional polytope presented by its vertices (a …”
Volltext