Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
APPROX
2015
Springer
19views Algorithms» more  APPROX 2015»
5 years 7 months ago
On Constant-Size Graphs That Preserve the Local Structure of High-Girth Graphs
Hendrik Fichtenberger, Pan Peng, Christian Sohler
APPROX
2015
Springer
19views Algorithms» more  APPROX 2015»
5 years 7 months ago
Harnessing the Bethe Free Energy
Gibbs measures induced by random factor graphs play a prominent role in computer science, combinatorics and physics. A key problem is to calculate the typical value of the partiti...
Victor Bapst, Amin Coja-Oghlan
APPROX
2015
Springer
14views Algorithms» more  APPROX 2015»
5 years 7 months ago
Internal Compression of Protocols to Entropy
We study internal compression of communication protocols to their internal entropy, which is the entropy of the transcript from the players’ perspective. We provide two internal...
Balthazar Bauer, Shay Moran, Amir Yehudayoff
APPROX
2015
Springer
21views Algorithms» more  APPROX 2015»
5 years 7 months ago
Stochastic and Robust Scheduling in the Cloud
Users of cloud computing services are offered rapid access to computing resources via the Internet. Cloud providers use different pricing options such as (i) time slot reservati...
Lin Chen, Nicole Megow, Roman Rischke, Leen Stougi...
APPROX
2015
Springer
21views Algorithms» more  APPROX 2015»
5 years 7 months ago
Separating Decision Tree Complexity from Subcube Partition Complexity
The subcube partition model of computation is at least as powerful as decision trees but no separation between these models was known. We show that there exists a function whose d...
Robin Kothari, David Racicot-Desloges, Miklos Sant...
APPROX
2015
Springer
17views Algorithms» more  APPROX 2015»
5 years 7 months ago
A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties
The problem of finding a maximum cardinality stable matching in the presence of ties and unacceptable partners, called MAX SMTI, is a well-studied NP-hard problem. The MAX SMTI i...
Chien-Chung Huang, Kazuo Iwama, Shuichi Miyazaki, ...
APPROX
2015
Springer
29views Algorithms» more  APPROX 2015»
5 years 7 months ago
A 2-Competitive Algorithm For Online Convex Optimization With Switching Costs
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnasw...
APPROX
2015
Springer
16views Algorithms» more  APPROX 2015»
5 years 7 months ago
Improved NP-Inapproximability for 2-Variable Linear Equations
An instance of the 2-Lin(2) problem is a system of equations of the form “xi + xj = b (mod 2)”. Given such a system in which it’s possible to satisfy all but an fraction of ...
Johan Håstad, Sangxia Huang, Rajsekar Manoka...
APPROX
2015
Springer
21views Algorithms» more  APPROX 2015»
5 years 7 months ago
Approximate Hypergraph Coloring under Low-discrepancy and Related Promises
Vijay V. S. P. Bhattiprolu, Venkatesan Guruswami, ...
books