On fixed-parameter tractability and approximability of NP-hard optimization problems

Cai, Liming; Chen, J.

doi:10.1109/istcs.1993.253478

Cited by 17 publications

(13 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Input readmodes of log-time alternating Turing machines also nd applications in the study of computational optimization problems 5,8] and in the study of limited nondeterminism 7].…”

Section: Introductionmentioning

confidence: 99%

Circuit Bottom Fan-in and Computational Power

Cai¹,

Chen²,

Håstad³

1998

SIAM J. Comput.

View full text Add to dashboard Cite

We i n vestigate the relationship between circuit bottom fan-in and circuit size when circuit depth is xed. We show that in order to compute certain functions, a moderate reduction in circuit bottom fan-in will cause signi cant increase in circuit size. In particular, we prove that there are functions that are computable by circuits of linear size and depth k with bottom fan-in 2 but require exponential size for circuits of depth k with bottom fan-in 1. A general scheme is established to study the trade-o between circuit bottom fan-in and circuit size. Based on this scheme, we are able to prove, for example, that for any integer c, there are functions that are computable by circuits of linear size and depth k with bottom fan-in O(log n) but require exponential size for circuits of depth k with bottom fan-in c, and that for any constant > 0, there are functions that are computable by circuits of linear size and depth k with bottom fan-in log n but require superpolynomial size for circuits of depth k with bottom fan-in O(log 1; n).A consequence of these results is that the three input read-modes of alternating Turing machines proposed in the literature are all distinct.Warning: Essentially this paper has been published in SIAM Journal on Computing and is hence subject to copyright restrictions. It is for personal use only.

show abstract

“…Input readmodes of log-time alternating Turing machines also nd applications in the study of computational optimization problems 5,8] and in the study of limited nondeterminism 7].…”

Section: Introductionmentioning

confidence: 99%

Circuit Bottom Fan-in and Computational Power

Cai¹,

Chen²,

Håstad³

1998

SIAM J. Comput.

View full text Add to dashboard Cite

show abstract

“…The goal of traditional heuristic scheduling algorithm is to obtain the shortest task finishing time (makespan). In this paper we call this algorithm as heuristic scheduling algorithm which is based on traditional min time makespan (for example, Graham-Schedule Algorithm [28]). In order to obtain the shortest task finishing time, the task of shortest finishing time will be selected from the task which will be assigned to processing nodes to run.…”

Section: Problem Solving Methodsmentioning

confidence: 99%

A Memory Configuration Method for Virtual Machine Based on User Preference in Distributed Cloud

2018

TIIS

View full text Add to dashboard Cite

It is well-known that virtualization technology can bring many benefits not only to users but also to service providers. From the view of system security and resource utility, higher resource sharing degree and higher system reliability can be obtained by the introduction of virtualization technology in distributed cloud. The small size time-sharing multiplexing technology which is based on virtual machine in distributed cloud platform can enhance the resource utilization effectively by server consolidation. In this paper, the concept of memory block and user satisfaction is redefined combined with user requirements. According to the unbalanced memory resource states and user preference requirements in multi-virtual machine environments, a model of proper memory resource allocation is proposed combined with memory block and user satisfaction, and at the same time a memory optimization allocation algorithm is proposed which is based on virtual memory block, makespan and user satisfaction under the premise of an orderly physical nodes states also. In the algorithm, a memory optimal problem can be transformed into a resource workload balance problem. All the virtual machine tasks are simulated in Cloudsim platform. And the experimental results show that the problem of virtual machine memory resource allocation can be solved flexibly and efficiently.

show abstract

“…Finally, we point out that the GC model also has nice applications in the study of fixed-parameter tractability of optimization problems [15]. We refer interested readers to our related work [9,10].…”

Section: This Concludes That the Algorithm Bwcs-simulator Is A π Bmentioning

confidence: 97%

On the Amount of Nondeterminism and the Power of Verifying

Cai¹,

Chen²

1997

SIAM J. Comput.

View full text Add to dashboard Cite

The relationship between nondeterminism and other computational resources is investigated based on the "guess-then-check" model GC. Systematic techniques are developed to construct natural complete languages for the classes defined by this model. This improves a number of previous results in the study of limited nondeterminism. Connections of the model GC to computational optimization problems are exhibited.

show abstract

On fixed-parameter tractability and approximability of NP-hard optimization problems

Cited by 17 publications

References 20 publications

Circuit Bottom Fan-in and Computational Power

Circuit Bottom Fan-in and Computational Power

A Memory Configuration Method for Virtual Machine Based on User Preference in Distributed Cloud

On the Amount of Nondeterminism and the Power of Verifying

Contact Info

Product

Resources

About