Sciweavers

ESA
2009
Springer
190views Algorithms» more  ESA 2009»
13 years 8 months ago
Polynomial-Time Algorithm for the Leafage of Chordal Graphs
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
Michel Habib, Juraj Stacho
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
13 years 9 months ago
Preemptive Online Scheduling with Reordering
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
György Dósa, Leah Epstein
ESA
2009
Springer
127views Algorithms» more  ESA 2009»
13 years 9 months ago
Geometric Spanners for Weighted Point Sets
Let (S, d) be a finite metric space, where each element p ∈ S has a non-negative weight w(p). We study spanners for the set S with respect to weighted distance function dw, wher...
Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, ...
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
13 years 9 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
13 years 9 months ago
Linear-Time Recognition of Probe Interval Graphs
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia...
Ross M. McConnell, Yahav Nussbaum
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
13 years 9 months ago
A Linear Time Algorithm for L(2, 1)-Labeling of Trees
Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yush...
ESA
2009
Springer
104views Algorithms» more  ESA 2009»
13 years 9 months ago
Hyperbolic Dovetailing
A familiar quandary arises when there are several possible alternatives for the solution of a problem, but no way of knowing which, if any, are viable for a particular problem inst...
David G. Kirkpatrick
ESA
2009
Springer
131views Algorithms» more  ESA 2009»
13 years 11 months ago
Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
Geevarghese Philip, Venkatesh Raman, Somnath Sikda...
ESA
2009
Springer
346views Algorithms» more  ESA 2009»
13 years 11 months ago
Hash, Displace, and Compress
A hash function h, i.e., a function from the set U of all keys to the range range [m] = {0, . . . , m − 1} is called a perfect hash function (PHF) for a subset S ⊆ U of size n ...
Djamal Belazzougui, Fabiano C. Botelho, Martin Die...
ESA
2009
Springer
98views Algorithms» more  ESA 2009»
13 years 11 months ago
The Oil Searching Problem
Given n potential oil locations, where each has oil at a certain depth, we seek good trade-offs between the number of oil sources found and the total amount of drilling performed. ...
Andrew McGregor, Krzysztof Onak, Rina Panigrahy