On Unknown Small Subsets and Implicit Measures： New Techniques for Parameterized Algorithms

Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science. In this paper, we investigate a number of new algorithm...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer science and technology Vol. 29; no. 5; pp. 870 - 878
Main Author: 陈建二 冯启龙
Format: Journal Article
Language:English
Published: Boston Springer US 01.09.2014
Springer Nature B.V
Subjects:
Algorithms
Artificial Intelligence
Computation
Computer Science
Data Structures and Information Theory
Information Systems Applications (incl.Internet)
NP难问题
Parameterization
Regular Paper
Software Engineering
Theory of Computation
亚群
参数算法
技术
算法参数
计算机科学
高效算法
randomized method
parameterized computation
implicit branching
ISSN:1000-9000, 1860-4749
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science. In this paper, we investigate a number of new algorithmic techniques that were proposed and initiated by ourselves in our research in parameterized computation. The techniques have proved to be very useful and promising,and have led to improved parameterized algorithms for many well-known NP-hard problems.
Bibliography:11-2296/TP
Parameterized computation is a recently proposed alternative approach to dealing with NP-hard problems.Developing efficient parameterized algorithms has become a very active research area in the current research in theoretical computer science. In this paper, we investigate a number of new algorithmic techniques that were proposed and initiated by ourselves in our research in parameterized computation. The techniques have proved to be very useful and promising,and have led to improved parameterized algorithms for many well-known NP-hard problems.
Jianer Chen,Qi-Long Feng（1School of Information Science and Engineering, Central South University, Changsha 410083, China ;2Department of Computer Science, Texas A＆M University, Texas 77843-3112, U.S.A.）
parameterized computation; randomized method; implicit branching
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1000-9000
1860-4749
DOI:10.1007/s11390-014-1474-1