#### Filter Results:

- Full text PDF available (30)

#### Publication Year

2005

2018

- This year (1)
- Last 5 years (21)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

Learn More

We consider the problem faced by a company that wants to use viral marketing to introduce a new product into a market where a competing product is already being introduced. We assume that consumers… (More)

We introduce new problems of finding minimum-cost rankings and clusterings which must be consistent with certain constraints (e.g. an input partial order in the case of ranking problems); we give… (More)

- Frans Schalekamp, Anke van Zuylen
- ALENEX
- 2009

We consider the problem of finding a ranking of a set of elements that is “closest to” a given set of input rankings of the elements; more precisely, we want to find a permutation that minimizes the… (More)

- Anke van Zuylen, David P. Williamson
- WAOA
- 2007

We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximation algorithms for… (More)

Determining the precise integrality gap for the subtour LP relaxation of the traveling salesman problem is a significant open question, with little progress made in thirty years in the general case… (More)

- Anke van Zuylen
- Algorithmica
- 2008

For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in Gupta et al. (J. ACM 54(3):11,… (More)

- David P. Williamson, Anke van Zuylen
- Oper. Res. Lett.
- 2007

We present a very simple way of derandomizing the algorithm proposed by Gupta, Kumar and Roughgarden for Single Source Rent-or-Buy by using the method of conditional expectation. Using the improved… (More)

In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipartite graph, the… (More)

- András Sebö, Anke van Zuylen
- 2016 IEEE 57th Annual Symposium on Foundations of…
- 2016

We give a new, strongly polynomial algorithm and improved analysis of the metric s-t path TSP. It finds a tour of cost less than 1.53 times the optimum of the subtour elimination LP, while known… (More)

In this paper, we study the integrality gap of the subtour LP relaxation for the traveling salesman problem in the special case when all edge costs are either 1 or 2. For the general case of… (More)