Work

Randomizing combinatorial algorithms for linear programming when the dimension is moderately high

Year: 2001

Type: conference-paper

Source: Symposium on Discrete Algorithms

DOI: 10.5555/365411.365425

Author: Marco Pellegrini

Institution: National Research Council

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

FWCI: 0.658

Cites: 18

Cited by: 5

Related to: 10