Work

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

Year: 2002

Type: conference-paper

Source: Israel Symposium on Theory and Computing Systems (ISTCS)

DOI: 10.1109/istcs.1993.253478

Authors: L. Cai, J. Chen

Institution: Texas A&M University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2112313560

FWCI: 0.472

Cites: 23

Cited by: 22

Related to: 10