Setting parameters by example

Author

Eppstein, David

Author_Institution

Dept. of Inf. & Comput. Sci., California Univ., Irvine, CA, USA

fYear

1999

fDate

1999

Firstpage

309

Lastpage

318

Abstract

We introduce a class of “inverse parametric optimization” problems, in which one is given both a parametric optimization problem and a desired optimal solution; the task is to determine parameter values that lead to the given solution. We describe algorithms for solving such problems for minimum spanning trees, shortest paths, and other “optimal subgraph” problems, and discuss applications in multicast routing, vehicle path planning, resource allocation, and board game programming

Keywords

computer games; inverse problems; multicast communication; optimisation; parameter estimation; path planning; randomised algorithms; resource allocation; telecommunication network routing; trees (mathematics); vehicles; board game programming; desired optimal solution; inverse parametric optimization; minimum spanning trees; multicast routing; optimal subgraph problems; parameter setting by example; parameter values; parametric optimization problem; resource allocation; shortest paths; vehicle path planning; Application software; Multicast algorithms; Network servers; Path planning; Resource management; Roads; Routing; Software algorithms; Vehicles; Web pages;

fLanguage

English

Publisher

ieee

Conference_Titel

Foundations of Computer Science, 1999. 40th Annual Symposium on

Conference_Location

New York City, NY

ISSN

0272-5428

Print_ISBN

0-7695-0409-4

Type

conf

DOI

10.1109/SFFCS.1999.814602

Filename

814602