Sciweavers

341 search results - page 48 / 69
» Paired bondage in trees
Sort
View
81
Voted
CATS
2007
14 years 11 months ago
Some Structural and Geometric Properties of Two-Connected Steiner Networks
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
K. Hvam, L. Reinhardt, Pawel Winter, Martin Zachar...
64
Voted
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
14 years 11 months ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
116
Voted
EOR
2007
198views more  EOR 2007»
14 years 9 months ago
Airline crew scheduling from planning to operations
Crew scheduling problems at the planning level are typically solved in two steps: first, creating working patterns, and then assigning these to individual crew. The first step is ...
Claude P. Medard, Nidhi Sawhney
CORR
2008
Springer
71views Education» more  CORR 2008»
14 years 9 months ago
Asteroids in rooted and directed path graphs
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
Kathie Cameron, Chính T. Hoàng, Benj...
67
Voted
MOR
2010
98views more  MOR 2010»
14 years 8 months ago
Sharing the Cost of a Capacity Network
We consider a communication network where each pair of users requests a connection guaranteeing a certain capacity. The cost of building capacity is identical across pairs. E cien...
Anna Bogomolnaia, Ron Holzman, Hervé Moulin