Sciweavers

127 search results - page 12 / 26
» Some Parameterized Problems On Digraphs
Sort
View
JUCS
2008
135views more  JUCS 2008»
13 years 7 months ago
Approximation to a Behavioral Model for Estimating Traffic Aggregation Scenarios
: This article provides a comparison among different methods for estimating the aggregation of Internet traffic resulting from different users, network-access types and correspondi...
Alberto E. Garcia, Klaus D. Hackbarth
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 5 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
CDC
2009
IEEE
137views Control Systems» more  CDC 2009»
14 years 3 days ago
Important moments in systems, control and optimization
— The moment problem matured from its various special forms in the late 19th and early 20th Centuries to a general class of problems that continues to exert profound influence o...
Christopher I. Byrnes, Anders Lindquist
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
14 years 7 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira
ALDT
2009
Springer
186views Algorithms» more  ALDT 2009»
14 years 2 months ago
The Complexity of Probabilistic Lobbying
Abstract. We propose various models for lobbying in a probabilistic environment, in which an actor (called “The Lobby”) seeks to influence the voters’ preferences of voting ...
Gábor Erdélyi, Henning Fernau, Judy ...