Work

Constant Approximation for Stochastic Orienteering Problem with $$(1+\epsilon )$$-Budget Relaxiation

Year: 2017

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/978-3-319-62389-4_25

Author: Yiyao Jiang

Institution: Tsinghua University

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

FWCI:

Cites: 16

Cited by:

Related to: 10