Sciweavers

413 search results - page 13 / 83
» On Solving Geometric Optimization Problems Using Shortest Pa...
Sort
View
COR
2008
142views more  COR 2008»
13 years 7 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
SODA
2008
ACM
122views Algorithms» more  SODA 2008»
13 years 9 months ago
A fractional model of the border gateway protocol (BGP)
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
14 years 8 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
DCG
2010
289views more  DCG 2010»
13 years 7 months ago
Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces
We consider the well known geometric problem of determining shortest paths between pairs of points on a polyhedral surface P, where P consists of triangular faces with positive we...
Lyudmil Aleksandrov, Hristo Djidjev, Hua Guo, Anil...
INFOCOM
2007
IEEE
14 years 1 months ago
DEFT: Distributed Exponentially-Weighted Flow Splitting
— Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer li...
Dahai Xu, Mung Chiang, Jennifer Rexford