Sciweavers

489 search results - page 41 / 98
» Approximation Algorithms for the Minimum-Length Corridor and...
Sort
View
116
Voted
ACSC
2009
IEEE
15 years 10 months ago
Microdata Protection Through Approximate Microaggregation
Microdata protection is a hot topic in the field of Statistical Disclosure Control, which has gained special interest after the disclosure of 658000 queries by the America Online...
Xiaoxun Sun, Hua Wang, Jiuyong Li
127
Voted
ALDT
2009
Springer
172views Algorithms» more  ALDT 2009»
15 years 10 months ago
On Multi-dimensional Envy-Free Mechanisms
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
Ahuva Mu'alem
119
Voted
FOCS
1996
IEEE
15 years 7 months ago
Path Coloring on the Mesh
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
Yuval Rabani
125
Voted
INFOCOM
2009
IEEE
15 years 10 months ago
Minimizing the Cost of Mine Selection Via Sensor Networks
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
Changlei Liu, Guohong Cao
123
Voted
NETWORKS
2007
15 years 3 months ago
Incremental flow
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
Jeff Hartline, Alexa Sharp