Sciweavers

IPL
2008
95views more  IPL 2008»
13 years 10 months ago
Distortion lower bounds for line embeddings
In this paper, we show how we can derive lower bounds and also compute the exact distortion for the line embeddings of some special metrics, especially trees and graphs with certai...
Claire Mathieu, Charalampos Papamanthou
IPL
2008
68views more  IPL 2008»
13 years 10 months ago
The hub number of a graph
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
Tracy Grauman, Stephen G. Hartke, Adam Jobson, Bil...
IPL
2008
79views more  IPL 2008»
13 years 10 months ago
Ski rental with two general options
We define and solve a simple extension of the ski-rental problem [4]. In the classical version, the algorithm needs to decide when to switch from renting to buying. In our version...
Zvi Lotker, Boaz Patt-Shamir, Dror Rawitz
IPL
2008
72views more  IPL 2008»
13 years 10 months ago
Turing degrees of reals of positive effective packing dimension
A relatively longstanding question in algorithmic randomness is Jan Reimann's question whether there is a Turing cone of broken dimension. That is, is there a real A such that...
Rod Downey, Noam Greenberg
IPL
2008
89views more  IPL 2008»
13 years 10 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
IPL
2008
80views more  IPL 2008»
13 years 10 months ago
A simpler competitive analysis for scheduling equal-length jobs on one machine with restarts
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
Michael H. Goldwasser, Arundhati Bagchi Misra
IPL
2008
114views more  IPL 2008»
13 years 10 months ago
The online Prize-Collecting Traveling Salesman Problem
We study the online version of the Prize-Collecting Traveling Salesman Problem (PCTSP), a generalization of the Traveling Salesman Problem (TSP). In the TSP, the salesman has to v...
Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura
IPL
2008
90views more  IPL 2008»
13 years 10 months ago
On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings
Generalized Petersen (GP) networks and periodically regular chordal (PRC) rings have been proposed independently to ameliorate the high latency and extreme fragility of simple rin...
Behrooz Parhami
IPL
2008
59views more  IPL 2008»
13 years 10 months ago
Rigidity of a simple extended lower triangular matrix
Meena Mahajan, Jayalal M. N. Sarma