Work

An Approximation Algorithm for Max p-Section

Year: 1999

Type: conference-paper

Source: Lecture notes in computer science

Parent work: STACS 99: 16th Annual Symposium on Theoretical Aspects of Computer Science Trier, Germany, March 4–6, 1999 Proceedings

DOI: 10.1007/3-540-49116-3_22

Author: Gunnar Andersson

Institution: KTH Royal Institute of Technology

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1573039931

FWCI: 1.726

Cites: 10

Cited by: 34

Related to: 9