554 search results - page 60 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
SPAA
1999
ACM
14 years 1 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
DMGT
2011
13 years 6 days ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
FOCS
2002
IEEE
14 years 1 months ago
2002
IEEE
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...