986 search results - page 155 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
GD
2008
Springer
13 years 8 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
GLOBECOM
2009
IEEE
13 years 5 months ago
2009
IEEE
How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific ...
SOFSEM
1997
Springer
13 years 12 months ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
MP
2007
13 years 7 months ago
2007
We present a probabilistic analysis of integer linear programs (ILPs). More specifically, we study ILPs in a so-called smoothed analysis in which it is assumed that first an adve...
SPAA
2004
ACM
14 years 1 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...