Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
10 years 8 months ago
Scheduling with Outliers
Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar...
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
10 years 8 months ago
On Hardness of Pricing Items for Single-Minded Bidders
Rohit Khandekar, Tracy Kimbrel, Konstantin Makaryc...
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
10 years 8 months ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
APPROX
2009
Springer
138views Algorithms» more  APPROX 2009»
10 years 8 months ago
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
Jon Lee, Maxim Sviridenko, Jan Vondrák
APPROX
2009
Springer
131views Algorithms» more  APPROX 2009»
10 years 8 months ago
An Approximation Scheme for Terrain Guarding
We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R....
APPROX
2009
Springer
118views Algorithms» more  APPROX 2009»
10 years 8 months ago
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
T. S. Jayram
APPROX
2009
Springer
177views Algorithms» more  APPROX 2009»
10 years 8 months ago
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems
Abstract. We consider the two-dimensional bin packing and strip packing problem, where a list of rectangles has to be packed into a minimal number of rectangular bins or a strip of...
Rolf Harren, Rob van Stee
APPROX
2009
Springer
115views Algorithms» more  APPROX 2009»
10 years 8 months ago
Small Clique Detection and Approximate Nash Equilibria
Recently, Hazan and Krauthgamer showed [12] that if, for a fixed small ε, an ε-best ε-approximate Nash equilibrium can be found in polynomial time in two-player games, then it ...
Lorenz Minder, Dan Vilenchik
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
10 years 8 months ago
On the Security of Goldreich's One-Way Function
Goldreich (ECCC 2000) suggested a simple construction of a candidate one-way function f : {0, 1}n → {0, 1}m where each bit of output is a fixed predicate P of a constant number ...
Andrej Bogdanov, Youming Qiao
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
10 years 8 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
books