1279 search results - page 149 / 256 » Approximation Algorithms for Min-Max Generalization Problems |
143
click to vote
AB
2007
Springer
15 years 8 months ago
2007
Springer
A series of papers, all under the title of Algorithmic Algebraic Model Checking (AAMC), has sought to combine techniques from algorithmic algebra, model checking and dynamical syst...
118
Voted
MOBIHOC
2002
ACM
16 years 1 months ago
2002
ACM
In this paper we assume that a multihop wireless network (also called a wireless ad hoc network) consists of nodes whose transmitting powers are finitely adjustable. We consider t...
112
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
This paper considers the problem of packet-mode scheduling of input queuedswitches. Packets have variable lengths, and are divided into cells of unit length. Each packet arrives t...
122
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
114
click to vote
JGO
2010
14 years 8 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...