[Front cover]

fYear

2011

fDate

22-25 Oct. 2011

Abstract

The following topics are dealt with: green computing algorithm; min-max graph partitioning; small set expansion; graph minor algorithm; constant factor approximation algorithm; profit maximization; homomorphic encryption; sharp mixing time bounds; multiple-source multiple-sink maximum flow; directed planar graphs; subpolynomial entropy; polylogarithmic-competitive algorithm; near optimal column-based matrix reconstruction; parallel approximation algorithm; Markov layout; optimal multidimensional pricing; randomized rounding approach; traveling salesman problem; Greedy algorithm; distributed decision making; continuous-time channels; random multilinear formulas; and stochastic combinatorial optimization problems.

Keywords

Markov processes; competitive algorithms; cryptography; directed graphs; distributed decision making; entropy; environmental factors; matrix algebra; optimisation; set theory; telecommunication channels; travelling salesman problems; Greedy algorithm; Markov layout; constant factor approximation algorithm; continuous-time channels; directed planar graphs; distributed decision making; graph minor algorithm; green computing algorithm; homomorphic encryption; min-max graph partitioning; multiple-source multiple-sink maximum flow; near optimal column-based matrix reconstruction; optimal multidimensional pricing; parallel approximation algorithm; polylogarithmic-competitive algorithm; profit maximization; random multilinear formulas; randomized rounding approach; sharp mixing time bounds; small set expansion; stochastic combinatorial optimization problems; subpolynomial entropy; traveling salesman problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on

Conference_Location

Palm Springs, CA

ISSN

0272-5428

Print_ISBN

978-1-4577-1843-4

Type

conf

DOI

10.1109/FOCS.2011.100

Filename

6108141