Sciweavers

57 search results - page 10 / 12
» Inapproximability of the Tutte polynomial
Sort
View
ECCC
2007
71views more  ECCC 2007»
13 years 9 months ago
Inverse Conjecture for the Gowers norm is false
Let p be a fixed prime number, and N be a large integer. The ’Inverse Conjecture for the Gowers norm’ states that if the ”d-th Gowers norm” of a function f : FN p → F i...
Shachar Lovett, Roy Meshulam, Alex Samorodnitsky
AAIM
2007
Springer
188views Algorithms» more  AAIM 2007»
14 years 4 months ago
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hirot...
INFOCOM
2011
IEEE
13 years 1 months ago
Delay constrained minimum energy broadcast in cooperative wireless networks
—We formulate the problem of delay constrained energy-efficient broadcast in cooperative multihop wireless networks. We show that this important problem is not only NPcomplete, ...
Marjan A. Baghaie, Bhaskar Krishnamachari
STOC
2006
ACM
170views Algorithms» more  STOC 2006»
14 years 10 months ago
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Producing a small DNF expression consistent with given data is a classical problem in computer science that occurs in a number of forms and has numerous applications. We consider ...
Vitaly Feldman
ICALP
2011
Springer
13 years 1 months ago
On Tree-Constrained Matchings and Generalizations
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...