6740 search results - page 1115 / 1348 » An s -Hamiltonian Line Graph Problem |
204
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
189
click to vote
ICDAR
2007
IEEE
16 years 29 days ago
2007
IEEE
The Machine Learning and Pattern Recognition communities are facing two challenges: solving the normalization problem, and solving the deep learning problem. The normalization pro...
181
Voted
SPAA
2005
ACM
16 years 6 days 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...
177
click to vote
SPAA
2005
ACM
16 years 6 days ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
173
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...