Sciweavers

18 search results - page 3 / 4
» Integrality Gaps of Linear and Semi-definite Programming Rel...
Sort
View
ICCV
2009
IEEE
14 years 10 months ago
Curvature Regularity for Region-based Image Segmentation and Inpainting: A Linear Programming Relaxation
We consider a class of region-based energies for image segmentation and inpainting which combine region integrals with curvature regularity of the region boundary. To minimize s...
Thomas Schoenemann, Fredrik Kahl, Daniel Cremers
COR
2007
108views more  COR 2007»
13 years 5 months ago
A hub location problem with fully interconnected backbone and access networks
This paper considers the design of two-layered fully interconnected networks.A two-layered network consists of clusters of nodes, each defining an access network and a backbone n...
Tommy Thomadsen, Jesper Larsen
MOR
2000
162views more  MOR 2000»
13 years 5 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
14 years 3 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
FOCS
2006
IEEE
13 years 11 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko