Sciweavers

287 search results - page 27 / 58
» Constant Factor Approximations for the Hotlink Assignment Pr...
Sort
View
TCS
2010
13 years 3 months ago
Maximizing the minimum load for selfish agents
We consider the problem of maximizing the minimum load for machines that are controlled by selfish agents, who are only interested in maximizing their own profit. Unlike the class...
Leah Epstein, Rob van Stee
FOCS
2006
IEEE
14 years 2 months ago
Approximate Min-Max Theorems of Steiner Rooted-Orientations of Hypergraphs
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...
Tamás Király, Lap Chi Lau
WWW
2011
ACM
13 years 3 months ago
Consideration set generation in commerce search
In commerce search, the set of products returned by a search engine often forms the basis for all user interactions leading up to a potential transaction on the web. Such a set of...
Sayan Bhattacharya, Sreenivas Gollapudi, Kamesh Mu...
TAMC
2009
Springer
14 years 3 months ago
A Simple Greedy Algorithm for the k-Disjoint Flow Problem
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
Maren Martens
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 10 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...