Sciweavers

2150 search results - page 38 / 430
» On a restricted cross-intersection problem
Sort
View
COCO
2004
Springer
133views Algorithms» more  COCO 2004»
15 years 3 months ago
Parameterized Complexity of Constraint Satisfaction Problems
We prove a parameterized analog of Schaefer’s Dichotomy Theorem: we show that for every finite boolean constraint family F, deciding whether a formula containing constraints fr...
Dániel Marx
FAW
2008
Springer
104views Algorithms» more  FAW 2008»
14 years 11 months ago
The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants
We study the parameterized complexity of an NP-complete geometric covering problem called d-dimensional Rectangle Stabbing where we are given a set of axis-parallel d-dimensional h...
Michael Dom, Somnath Sikdar
ORL
2002
92views more  ORL 2002»
14 years 9 months ago
Efficient feasibility testing for dial-a-ride problems
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
Brady Hunsaker, Martin W. P. Savelsbergh
FOCS
2000
IEEE
15 years 2 months ago
Optimization Problems in Congestion Control
One of the crucial elements in the Internet’s success is its ability to adequately control congestion. This paper defines and solves several optimization problems related to In...
Richard M. Karp, Elias Koutsoupias, Christos H. Pa...
AIPS
2007
15 years 1 days ago
Temporally-Expressive Planning as Constraint Satisfaction Problems
Due to its important practical applications, temporal planning is of great research interest in artificial intelligence. Yet most of the work in this area so far is limited in at...
Yuxiao Hu