optimization | Sciweavers

Abstract. We study the quality of equilibrium in atomic splittable routing games. We show that in single-source single-sink games on seriesparallel graphs, the price of collusion -...

Umang Bhaskar, Lisa Fleischer, Chien-Chung Huang

claim paper

Read More »

36

click to vote

IPCO
2010

125views Optimization» more IPCO 2010»

A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information

13 years 10 months ago

Download www.mpi-inf.mpg.de

Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...

Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...

claim paper

Read More »

23

click to vote

IPCO
2010

147views Optimization» more IPCO 2010»

On k-Column Sparse Packing Programs

13 years 10 months ago

Download www.cs.umd.edu

Nikhil Bansal, Nitish Korula, Viswanath Nagarajan,...

claim paper

Read More »

23

click to vote

IPCO
2010

152views Optimization» more IPCO 2010»

Hypergraphic LP Relaxations for Steiner Trees

13 years 10 months ago

Download sma.epfl.ch

We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by K

Deeparnab Chakrabarty, Jochen Könemann, David...

claim paper

Read More »

22

click to vote

IPCO
2010

134views Optimization» more IPCO 2010»

Restricted b-Matchings in Degree-Bounded Graphs

13 years 10 months ago

Download www.cs.elte.hu

Kristóf Bérczi, László...

claim paper

Read More »

18

click to vote

IPCO
2010

143views Optimization» more IPCO 2010»

Fault-Tolerant Facility Location: A Randomized Dependent LP-Rounding Algorithm

13 years 10 months ago

Download www.cs.umd.edu

Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swam...

claim paper

Read More »

29

click to vote

IPCO
2010

184views Optimization» more IPCO 2010»

Computing Minimum Multiway Cuts in Hypergraphs from Hypertree Packings

13 years 10 months ago

Download www-or.amp.i.kyoto-u.ac.jp

Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...

Takuro Fukunaga

claim paper

Read More »

20

click to vote

COLOGNETWENTE
2008

65views Optimization» more COLOGNETWENTE 2008»

Global r-alliances and total domination

13 years 10 months ago