Work

Combinatorial Linear Programming: Geometry Can Help

Year: 1998

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-49543-6_8

Author: Bernd Gärtner

Institutions: ETH Zurich, Institute of Theoretical Computer Science

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: W1502914608

FWCI: 1.495

Cites: 20

Cited by: 19

Related to: 10