Join Our Newsletter

SODA

2012

ACM

7 years 4 months ago
2012

ACM

We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...

SODA

2012

ACM

7 years 4 months ago
2012

ACM

The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...

ISPD

2012

ACM

7 years 10 months ago
2012

ACM

In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...

ICALP

2011

Springer

8 years 5 months ago
2011

Springer

We present an O( √ n log n)-approximation algorithm for the problem of ﬁnding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...

ICALP

2011

Springer

8 years 5 months ago
2011

Springer

Given a directed graph G = (V, E) and an integer k ≥ 1, a Steiner k-transitive-closure-spanner (Steiner k-TC-spanner) of G is a directed graph H = (VH , EH ) such that (1) V ⊆ ...

ACL

2009

9 years 6 days ago
2009

We formulate the problem of nonprojective dependency parsing as a polynomial-sized integer linear program. Our formulation is able to handle non-local output features in an effici...

ORL

2008

9 years 2 months ago
2008

We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...

COR

2007

9 years 2 months ago
2007

This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each deﬁning an access network and a backbone n...

COR

2007

9 years 2 months ago
2007

Column generation has proven to be efﬁcient in solving the linear programming relaxation of large scale instances ofthemultiple-depotvehicleschedulingproblem(MDVSP).Howeverdif...

DISOPT

2008

9 years 2 months ago
2008

Given a mixed-integer linear programming (MILP) model and an optimal basis of the associated linear programming relaxation, the Gomory's corner relaxation is obtained by drop...